Sciweavers

1167 search results - page 88 / 234
» A Really Temporal Logic
Sort
View
LOGCOM
2000
93views more  LOGCOM 2000»
13 years 9 months ago
The product of converse PDL and polymodal K
The product of two modal logics L1 and L2 is the modal logic determined by the class of frames of the form FG such that F and G validate L1 and L2, respectively. This paper proves...
Frank Wolter
CADE
2008
Springer
14 years 10 months ago
Compositional Proofs with Symbolic Execution
Abstract. A proof method is described which combines compositional proofs of interleaved parallel programs with the intuitive and highly automatic strategy of symbolic execution. A...
Simon Bäumler, Florian Nafz, Michael Balser, ...
TIME
2007
IEEE
14 years 4 months ago
On Construction of Holistic Synopses under the Duplicate Semantics of Streaming Queries
Transaction-time temporal databases and query languages provide a solid framework for analyzing properties of queries over data streams. In this paper we focus on issues connected...
David Toman
ICTAC
2004
Springer
14 years 3 months ago
Duration Calculus: A Real-Time Semantic for B
Among the possible approaches for expressing real-time problems with the B method, two are dominant : the use of the usual B mechanisms to define temporal constraints on the one h...
Samuel Colin, Georges Mariano, Vincent Poirriez
LFCS
2009
Springer
14 years 4 months ago
Completeness Results for Memory Logics
Memory logics are a family of modal logics in which standard relational structures are augmented with data structures and additional operations to modify and query these structure...
Carlos Areces, Santiago Figueira, Sergio Mera