Sciweavers

4257 search results - page 77 / 852
» The Logical Modularity of Programs
Sort
View
LOPSTR
2009
Springer
15 years 6 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...
SAS
2007
Springer
15 years 6 months ago
Modular Safety Checking for Fine-Grained Concurrency
Concurrent programs are difficult to verify because the proof must consider the interactions between the threads. Fine-grained concurrency and heap allocated data structures exacer...
Cristiano Calcagno, Matthew J. Parkinson, Viktor V...
PADL
2007
Springer
15 years 6 months ago
Inductive Logic Programming by Instance Patterns
Chongbing Liu, Enrico Pontelli
PPDP
2001
Springer
15 years 4 months ago
Termination of Well-Typed Logic Programs
Annalisa Bossi, Nicoletta Cocco, Sabina Rossi