Sciweavers

Share
12 search results - page 1 / 3
» Deciding Full Branching Time Logic by Program Transformation
Sort
View
LOPSTR
2009
Springer
11 years 8 months ago
Deciding Full Branching Time Logic by Program Transformation
Abstract. We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL∗ ) properties of finite state reactive systems. The finite state ...
Alberto Pettorossi, Maurizio Proietti, Valerio Sen...
LPNMR
2007
Springer
11 years 7 months ago
Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains
Recent research in answer-set programming (ASP) is concerned with the problem of finding faithful transformations of logic programs under the stable semantics. This is in particul...
Michael Fink, Reinhard Pichler, Hans Tompits, Stef...
LOGCOM
2007
91views more  LOGCOM 2007»
11 years 1 months ago
A New Modal Approach to the Logic of Intervals
In Artificial Intelligence there is a need for reasoning about continuous processes, where assertions refer to time intervals rather than time points. Taking our lead from van Ben...
Altaf Hussain
PADO
2001
Springer
11 years 5 months ago
Run-Time Bytecode Specialization
This paper describes a run-time specialization system for the Java language. One of the main difficulties of supporting the full Java language resides in a sound yet effective ma...
Hidehiko Masuhara, Akinori Yonezawa
ESOP
2000
Springer
11 years 5 months ago
Compile-Time Debugging of C Programs Working on Trees
We exhibit a technique for automatically verifying the safety of simple C programs working on tree-shaped data structures. We do not consider the complete behavior of programs, but...
Jacob Elgaard, Anders Møller, Michael I. Sc...
books