Sciweavers

63 search results - page 12 / 13
» Automated Termination Analysis for Programs with Second-Orde...
Sort
View
IJCAI
1993
13 years 6 months ago
A New Logical framework for Deductive Planning
objects, like elements of (abstract) data types in ordinary programming languages In the theory of abstract data types most often one only considers algebraic structures where all ...
Werner Stephan, Susanne Biundo
ICLP
1997
Springer
13 years 9 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...
LOPSTR
2007
Springer
13 years 11 months ago
Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation
Homeomorphic Embedding (HEm) has proven to be very powerful for supervising termination of computations, provided that such computations are performed over a finite signature, i.e...
Elvira Albert, John P. Gallagher, Miguel Gó...
SIGSOFT
2005
ACM
14 years 6 months ago
Fluent temporal logic for discrete-time event-based models
Fluent model checking is an automated technique for verifying that an event-based operational model satisfies some state-based declarative properties. The link between the event-b...
Emmanuel Letier, Jeff Kramer, Jeff Magee, Sebasti&...
SIGSOFT
2003
ACM
13 years 10 months ago
Fluent model checking for event-based systems
Model checking is an automated technique for verifying that a system satisfies a set of required properties. Such properties are typically expressed as temporal logic formulas, in...
Dimitra Giannakopoulou, Jeff Magee