Sciweavers

233 search results - page 14 / 47
» Specifying, Programming and Verifying with Equational Logic
Sort
View
KBSE
2010
IEEE
13 years 5 months ago
Solving string constraints lazily
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent ...
Pieter Hooimeijer, Westley Weimer
ATAL
2005
Springer
14 years 29 days ago
Bounded model checking for knowledge and real time
We present TECTLK, a logic to specify knowledge and real time in multi-agent systems. We show that the model checking problem is decidable, and we present an algorithm for TECTLK ...
Bozena Wozna, Alessio Lomuscio, Wojciech Penczek
PPDP
2009
Springer
14 years 1 months ago
Dependent type inference with interpolants
We propose a novel type inference algorithm for a dependentlytyped functional language. The novel features of our algorithm are: (i) it can iteratively refine dependent types wit...
Hiroshi Unno, Naoki Kobayashi
CADE
2004
Springer
14 years 7 months ago
Rewriting Logic Semantics: From Language Specifications to Formal Analysis Tools
Formal semantic definitions of concurrent languages, when specified in a well-suited semantic framework and supported by generic and efficient formal tools, can be the basis of pow...
José Meseguer, Grigore Rosu
TOPLAS
2002
98views more  TOPLAS 2002»
13 years 7 months ago
Data abstraction and information hiding
traction and information hiding K. RUSTAN M. LEINO and GREG NELSON Compaq Systems Research Center er describes an approach for verifying programs in the presence of data abstractio...
K. Rustan M. Leino, Greg Nelson