Sciweavers

933 search results - page 115 / 187
» Extending Forward Checking
Sort
View
JCT
2007
107views more  JCT 2007»
15 years 1 months ago
Vertex-minors, monadic second-order logic, and a conjecture by Seese
We prove that one can express the vertex-minor relation on finite undirected graphs by formulas of monadic second-order logic (with no edge set quantification) extended with a p...
Bruno Courcelle, Sang-il Oum
TOPLAS
2008
79views more  TOPLAS 2008»
14 years 11 months ago
Witnessing side effects
We present a new approach to the old problem of adding side effects to purely functional languages. Our idea is to extend the language with "witnesses," which is based o...
Tachio Terauchi, Alex Aiken
JOT
2010
99views more  JOT 2010»
14 years 11 months ago
A Framework for Adding Design by ContractTM to the .NET Object-Oriented Programming Languages
Design contracts can be used in software development to ensure the preservation of assertions for program correctness. This can increase reliability in software design. Design by ...
Jennifer Pandolfo, Cui Zhang
LPAR
2010
Springer
14 years 11 months ago
Dafny: An Automatic Program Verifier for Functional Correctness
Traditionally, the full verification of a program's functional correctness has been obtained with pen and paper or with interactive proof assistants, whereas only reduced ver...
K. Rustan M. Leino
FORTE
2009
14 years 11 months ago
Typing Component-Based Communication Systems
Abstract. Building complex component-based software systems, for instance communication systems based on the Click, Coyote, Appia, or Dream frameworks, can lead to subtle assemblag...
Michael Lienhardt, Claudio Antares Mezzina, Alan S...