99 Hits in 3.3 sec

Logical Data Expiration for Fixpoint Extensions of Temporal Logics [chapter]

David Toman
2003 Lecture Notes in Computer Science  
doi:10.1007/978-3-540-45072-6_22 fatcat:cvdgf34bhfgslkmtt36rbeqzqq

Logical Data Expiration [chapter]

David Toman
2004 Logics for Emerging Applications of Databases  
This chapter formalizes the notion of data expiration in terms of how the data is used to answer queries.  ...  Data expiration is an essential component of data warehousing solutions: whenever large amounts of data are repeatedly collected over a period of time, it is essential to have a clear approach to identifying  ...  The author gratefully acknowledges support by the Natural Sciences and Engineering Research Council of Canada. Part of this work was done while visiting BRICS 8 at the University of Aarhus.  ... 
doi:10.1007/978-3-642-18690-5_6 fatcat:jwkgqjaazbgu3i2byd533dwixi

On Construction of Holistic Synopses under the Duplicate Semantics of Streaming Queries

David Toman
2007 14th International Symposium on Temporal Representation and Reasoning (TIME'07)  
We link the problem to the problem of query-driven data expiration in append-only temporal databases and study space bounds on synopses that are sufficient and necessary for query answering under duplicate  ...  Transaction-time temporal databases and query languages provide a solid framework for analyzing properties of queries over data streams.  ...  Another direction of research is to consider appropriate ways to approximate the answers and trade-offs between quality of the approximations and space needed for storing synopses.  ... 
doi:10.1109/time.2007.55 dblp:conf/time/Toman07 fatcat:u76z5svrprh4lih637s356u5j4

Modeling and Verifying Time Sensitive Security Protocols with Constraints

Ti Zhou, Mengjun Li, Zhoujun Li, Huowang Chen
2008 Electronical Notes in Theoretical Computer Science  
Firstly, an extension of π calculus is given to model a time sensitive security protocol.  ...  And then, by appending linear arithmetic constraints to the Horn logic model, the extended Horn logic model of security protocols and the modified-version verification method with time constraints are  ...  Xiaoyu Song for useful discussions about the structure of this paper and useful modifications for its presentation.  ... 
doi:10.1016/j.entcs.2008.04.056 fatcat:b4rslhxiyjhp3int4bnufylqlq

Models and emerging trends of concurrent constraint programming

Carlos Olarte, Camilo Rueda, Frank D. Valencia
2013 Constraints  
linearity (consumption of constraints) for imperative data structures.  ...  Furthermore, we shall show the extensions of CCP to cope with: soft constraints where agents can express preferences; communication of local names or links (i.e. mobility) for net-centric computing and  ...  We thank the anonymous reviewers for their detailed comments that helped us to improve this paper. Special thanks to Jorge A. Perez for his careful remarks and suggestions.  ... 
doi:10.1007/s10601-013-9145-3 fatcat:7mx6xnyfcjad7musa373vockne

On periodicity in temporal databases

Alexander Tuzhilin, James Clifford
1995 Information Systems  
The issue of periodicity is generally understood to be a desirable property of temporal data that should be supported by temporal database models and their query languages.  ...  , such as the proposed temporal extension t o SQL, in a clean and straightforward manner. i Introduction Periodicity is a feature of temporal phenomena t h a t has received relatively little attention  ...  Acknowledgments The authors would like to thank the reviewers for their valuable comments which have helped to improve the presentation of this paper.  ... 
doi:10.1016/0306-4379(95)00034-8 fatcat:rmnfyr34ybgcjeabssq2wxjwuu

Analyzing partially-implemented real-time systems

George S. Avrunin, James C. Corbett, Laura K. Dillon
1997 Proceedings of the 19th international conference on Software engineering - ICSE '97  
temporal logic.  ...  We show how to construct models of the partiallyimplemented systems that account for such properties as run-time overhead and scheduling of processes, yet support tractable analysis of nontrivial programs  ...  Bidirectional searches are defined in terms of the standard GIL operators and the next state operator of propositional temporal logic.  ... 
doi:10.1145/253228.253275 dblp:conf/icse/AvruninCD97 fatcat:yyia2hagjjfqfnfoobuqp2wxom

Analyzing partially-implemented real-time systems

G.S. Avrunin, J.C. Corbett, L.K. Dillon
1998 IEEE Transactions on Software Engineering  
temporal logic.  ...  We show how to construct models of the partiallyimplemented systems that account for such properties as run-time overhead and scheduling of processes, yet support tractable analysis of nontrivial programs  ...  Bidirectional searches are defined in terms of the standard GIL operators and the next state operator of propositional temporal logic.  ... 
doi:10.1109/32.707696 fatcat:5vbnmy2n2na4lbcfo6pobpy7b4

Logical concepts in cryptography

Simon Kramer
2007 ACM SIGACT News  
In the light of logic, adding PP to a formalism for cryptographic protocols is perhaps also simple and can be achieved with an Ockham's razor extension of an existing core logic, namely CPL.  ...  (for Cryptographic Protocol Logic).  ...  advice on the practice of being a Ph.D. student; Henrik Imhof for his abiding Upanishads on mathematical logic; Michael Mendler for our early  ... 
doi:10.1145/1345189.1345205 fatcat:wyk6rfbagbfwrasry7ohjjbq5q

The symmetry of the past and of the future

Matteo Pradella, Angelo Morzenti, Pierluigi San Pietro
2007 Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering - ESEC-FSE '07  
The present paper is centered on the problem of satisfiability checking of linear temporal logic (LTL) formulae with past operators.  ...  Our claims are supported by a tool, whose application to a case study shows that satisfiability checking may be feasible also on nontrivial examples of temporal logic specifications.  ...  INTRODUCTION Linear-time Temporal Logic (LTL), also in its version augmented with past operators (PLTL: past LTL), has been extensively applied to the specification, validation and verification of critical  ... 
doi:10.1145/1287624.1287669 dblp:conf/sigsoft/PradellaMP07 fatcat:73ogxtpbdrfidogsvupdmbzike

Formal verification of timed systems: a survey and perspective

Farn Wang
2004 Proceedings of the IEEE  
An overview of the current state of the art of formal verification of real-time systems is presented.  ...  fixpoint computation.  ...  There is also an extensive library of term rewriting techniques for first-order and higher order logics [77] , [135] .  ... 
doi:10.1109/jproc.2004.831197 fatcat:7e5u5rvdbncqbmkku7szkdyz34

Using Generalized Annotated Programs to Solve Social Network Diffusion Optimization Problems

Paulo Shakarian, Matthias Broecheler, V. S. Subrahmanian, Cristian Molinaro
2013 ACM Transactions on Computational Logic  
For example, in epidemiology, officials want to find a set of k individuals in a social network which, if treated, would minimize spread of a disease.  ...  There has been extensive work in many different fields on how phenomena of interest (e.g. diseases, innovation, product adoption) "diffuse" through a social network.  ...  Some of the authors of this paper were funded in part by AFOSR grant FA95500610405, ARO grant W911NF0910206 and ONR grant N000140910685.  ... 
doi:10.1145/2480759.2480762 fatcat:vznfhv7kibgm5ecpn3y3j6rjwa

Inferring dynamic credentials for rôle-based trust management

Daniele Gorla, Matthew Hennessy, Vladimiro Sassone
2006 Proceedings of the 8th ACM SIGPLAN symposium on Principles and practice of declarative programming - PPDP '06  
The topic of this paper is the rôle-based trust-management language RT0, a formalism inspired by logic programming that handles trust in large scale, decentralised systems.  ...  In addition to a set-theoretic and a logicprogramming semantics, we develop for the extended language a series of increasingly powerful inference systems for establishing these conditional credentials.  ...  Acknowledgements We would like to thank Catuscia Palamidessi for several pointers and suggestions in the field of logic programming.  ... 
doi:10.1145/1140335.1140361 dblp:conf/ppdp/GorlaHS06 fatcat:kymkls524raalccj24552qxlby

The declarative imperative

Joseph M. Hellerstein
2010 SIGMOD record  
This juxtaposition raises the possibility that the theory of declarative database query languages can provide a foundation for the next generation of parallel and distributed programming languages.  ...  In this paper I reflect on my group's experience over seven years using Datalog extensions to build networking protocols and distributed systems.  ...  Overlog fixpoint computation.  ... 
doi:10.1145/1860702.1860704 fatcat:p7w5mmjqqjh5pmu2gbmtm24kau

Embedding Chaos [chapter]

Natalia Sidorova, Martin Steffen
2001 Lecture Notes in Computer Science  
We use data-flow analysis to detect instances of chaotic variables and timers and prove the soundness of the transformation, which is based on the result of the analysis.  ...  However, for model checking, the way of closing should be wellconsidered to alleviate the state-space explosion problem.  ...  MOCHA [5] is a model checker for reactive modules, which uses alternating-time temporal logic [4] as specification language.  ... 
doi:10.1007/3-540-47764-0_18 fatcat:h6m3ngk2snhfhgpfrsudz7ceau
« Previous Showing results 1 — 15 out of 99 results