Sciweavers

1194 search results - page 82 / 239
» A Language for Implementing Arbitrary Logics
Sort
View
AI
2005
Springer
14 years 9 months ago
First order LUB approximations: characterization and algorithms
One of the major approaches to approximation of logical theories is the upper and lower bounds approach introduced in (Selman and Kautz, 1991, 1996). In this paper, we address the...
Alvaro del Val
PPDP
2007
Springer
15 years 3 months ago
Mechanized metatheory model-checking
The problem of mechanically formalizing and proving metatheoretic properties of programming language calculi, type systems, operational semantics, and related formal systems has r...
James Cheney, Alberto Momigliano
AICOM
2010
127views more  AICOM 2010»
14 years 10 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, ...
CORR
2010
Springer
147views Education» more  CORR 2010»
14 years 6 months ago
RAFDA: A Policy-Aware Middleware Supporting the Flexible Separation of Application Logic from Distribution
Middleware technologies often limit the way in which object classes may be used in distributed applications due to the fixed distribution policies that they impose. These policies...
Scott M. Walker, Alan Dearle, Stuart J. Norcross, ...
POPL
2010
ACM
15 years 7 months ago
A Verified Compiler for an Impure Functional Language
We present a verified compiler to an idealized assembly language from a small, untyped functional language with mutable references and exceptions. The compiler is programmed in th...
Adam J. Chlipala