Sciweavers

32 search results - page 4 / 7
» Optimizing Slicing of Formal Specifications by Deductive Ver...
Sort
View
91
Voted
ICAIL
2003
ACM
15 years 2 months ago
Specifying and Reasoning with Institutional Agents
This paper proposes a logic-oriented framework for institutional agents specification and analysis. Within this framework institutional agents are seen as artificial agents that a...
Filipe Santos, Olga Pacheco
PE
2002
Springer
132views Optimization» more  PE 2002»
14 years 9 months ago
Performance evaluation with temporal rewards
Today many formalisms exist for specifying complex Markov chains. In contrast, formalisms for specifying rewards, enabling the analysis of long-run average performance properties,...
Jeroen Voeten
SAC
2006
ACM
14 years 9 months ago
Assisted verification of elementary functions using Gappa
The implementation of a correctly rounded or interval elementary function needs to be proven carefully in the very last details. The proof requires a tight bound on the overall er...
Florent de Dinechin, Christoph Quirin Lauter, Guil...
SAC
2010
ACM
14 years 7 months ago
A machine-checked soundness proof for an efficient verification condition generator
Verification conditions (VCs) are logical formulae whose validity implies the correctness of a program with respect to a specification. The technique of checking software properti...
Frédéric Vogels, Bart Jacobs 0002, F...
109
Voted
PEPM
2010
ACM
14 years 11 months ago
A3PAT, an approach for certified automated termination proofs
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
Evelyne Contejean, Andrey Paskevich, Xavier Urbain...