Sciweavers

5506 search results - page 639 / 1102
» Minimal Logic Programs
Sort
View
181
Voted
CASES
2006
ACM
16 years 25 days ago
Extensible control architectures
Architectural advances of modern systems has often been at odds with control complexity, requiring significant effort in both design and verification. This is particularly true ...
Greg Hoover, Forrest Brewer, Timothy Sherwood
CADE
2007
Springer
16 years 7 months ago
A Sequent Calculus for Integer Arithmetic with Counterexample Generation
We introduce a calculus for handling integer arithmetic in first-order logic. The method is tailored to Java program verification and meant to be used both as a supporting procedur...
Philipp Rümmer
277
Voted
SIGMOD
2006
ACM
122views Database» more  SIGMOD 2006»
16 years 7 months ago
The ADO.NET entity framework: making the conceptual level real
This paper describes the ADO.NET Entity Framework, a platform for programming against data that raises the level of ion from the logical (relational) level to the conceptual (enti...
Anil Nori, José A. Blakeley, S. Muralidhar
136
Voted
TACAS
2010
Springer
178views Algorithms» more  TACAS 2010»
16 years 1 months ago
An Alternative to SAT-Based Approaches for Bit-Vectors
The theory BV of bit-vectors, i.e. fixed-size arrays of bits equipped with standard low-level machine instructions, is becoming very popular in formal verification. Standard solv...
Sébastien Bardin, Philippe Herrmann, Floria...
182
Voted
FOSSACS
2007
Springer
16 years 1 months ago
PDL with Intersection and Converse Is 2 EXP-Complete
We study the complexity of satisfiability for the expressive extension ICPDL of PDL (Propositional Dynamic Logic), which admits intersection and converse as program operations. Ou...
Stefan Göller, Markus Lohrey, Carsten Lutz