Sciweavers

756 search results - page 29 / 152
» Using Logic Programs to Reason about Infinite Sets
Sort
View
KR
1991
Springer
15 years 1 months ago
Meta-Reasoning in Executable Temporal Logic
Temporal logic can be used as a programming language. If temporal formulae are represented in the form of an implication where the antecedent refers to the past, and the consequen...
Howard Barringer, Michael Fisher, Dov M. Gabbay, A...
FCSC
2010
170views more  FCSC 2010»
14 years 7 months ago
Formal verification of concurrent programs with read-write locks
Abstract Read-write locking is an important mechanism to improve concurrent granularity, but it is difficult to reason about the safety of concurrent programs with read-write locks...
Ming Fu, Yu Zhang, Yong Li
153
Voted
POPL
2005
ACM
15 years 10 months ago
Automated soundness proofs for dataflow analyses and transformations via local rules
We present Rhodium, a new language for writing compiler optimizations that can be automatically proved sound. Unlike our previous work on Cobalt, Rhodium expresses optimizations u...
Sorin Lerner, Todd D. Millstein, Erika Rice, Craig...
COSIT
2011
Springer
322views GIS» more  COSIT 2011»
13 years 9 months ago
CLP(QS): A Declarative Spatial Reasoning Framework
Abstract. We propose CLP(QS), a declarative spatial reasoning framework capable of representing and reasoning about high-level, qualitative spatial knowledge about the world. We sy...
Mehul Bhatt, Jae Hee Lee, Carl Schultz
AICOM
2010
127views more  AICOM 2010»
14 years 9 months ago
Interactive verification of concurrent systems using symbolic execution
This paper presents an interactive proof method for the verification of temporal properties of concurrent systems based on symbolic execution. Symbolic execution is a well known a...
Simon Bäumler, Michael Balser, Florian Nafz, ...