Sciweavers

239 search results - page 35 / 48
» Temporal Languages for Epistemic Programs
Sort
View
POPL
2005
ACM
15 years 9 months ago
Transition predicate abstraction and fair termination
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
Andreas Podelski, Andrey Rybalchenko
93
Voted
LICS
2005
IEEE
15 years 3 months ago
Uniform Distributed Synthesis
We provide a uniform solution to the problem of synthesizing a finite-state distributed system. An instance of the synthesis problem consists of a system architecture and a tempo...
Bernd Finkbeiner, Sven Schewe
163
Voted
POPL
2007
ACM
15 years 9 months ago
On the analysis of interacting pushdown systems
Pushdown Systems (PDSs) has become an important paradigm for program analysis. Indeed, recent work has shown a deep connection between inter-procedural dataflow analysis for seque...
Vineet Kahlon, Aarti Gupta
VL
1996
IEEE
162views Visual Languages» more  VL 1996»
15 years 1 months ago
Interactive Authoring of Multimedia Documents
As multimedia applications spread widely, it is crucial for programming and design support systems to handle "time" in multimedia documents effectively and flexibly. This...
Junehwa Song, Michelle Y. Kim, G. Ramalingam, Raym...
82
Voted
ICLP
1997
Springer
15 years 1 months ago
The Complexity of Model Checking in Modal Event Calculi
Kowalski and Sergot’s Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which propert...
Iliano Cervesato, Massimo Franceschet, Angelo Mont...