Sciweavers

858 search results - page 84 / 172
» Abstract Interpretation Based Verification of Logic Programs
Sort
View
CADE
2007
Springer
16 years 5 days ago
Solving Quantified Verification Conditions Using Satisfiability Modulo Theories
Abstract. First order logic provides a convenient formalism for describing a wide variety of verification conditions. Two main approaches to checking such conditions are pure first...
Yeting Ge, Clark Barrett, Cesare Tinelli
SPIN
2000
Springer
15 years 3 months ago
The Temporal Rover and the ATG Rover
The Temporal Rover is a specification based verification tool for applications written in C, C++, Java, Verilog and VHDL. The tool combines formal specification, using Linear-Time ...
Doron Drusinsky
ECOOP
2008
Springer
15 years 1 months ago
Computing Stack Maps with Interfaces
Abstract. Lightweight bytecode verification uses stack maps to annotate Java bytecode programs with type information in order to reduce the verification to type checking. This pape...
Frédéric Besson, Thomas P. Jensen, T...
CIA
2003
Springer
15 years 5 months ago
Logic Programming for Evolving Agents
Abstract. Logic programming has often been considered less than adequate for modelling the dynamics of knowledge changing over time. In this paper we describe Evolving Logic Progra...
José Júlio Alferes, Antonio Brogi, J...
ICLP
2005
Springer
15 years 5 months ago
Nondeterminism Analysis of Functional Logic Programs
Abstract. Information about the nondeterminism behavior of a functional logic program is important for various reasons. For instance, a nondeterministic choice in I/O operations re...
Bernd Braßel, Michael Hanus