Sciweavers

899 search results - page 118 / 180
» A CTL-Based Logic for Program Abstractions
Sort
View
116
Voted
ASP
2003
Springer
15 years 5 months ago
Implementing OCLP as a front-end for Answer Set Solvers: From Theory to Practice
Abstract. Ordered Choice Logic Programming (OCLP) allows for preferencebased decision-making with multiple alternatives and without the burden of any form of negation. This complet...
Martin Brain, Marina De Vos
DRM
2007
Springer
15 years 6 months ago
Slicing obfuscations: design, correctness, and evaluation
The goal of obfuscation is to transform a program, without affecting its functionality, such that some secret information within the program can be hidden for as long as possible...
Anirban Majumdar, Stephen Drape, Clark D. Thombors...
106
Voted
CADE
2007
Springer
16 years 24 days ago
Inferring Invariants by Symbolic Execution
In this paper we propose a method for inferring invariants for loops in Java programs. An example of a simple while loop is used throughout the paper to explain our approach. The m...
Benjamin Weiß, Peter H. Schmitt
100
Voted
EACL
2006
ACL Anthology
15 years 1 months ago
XMG - An Expressive Formalism for Describing Tree-Based Grammars
In this paper1 we introduce eXtensible MetaGrammar, a system that facilitates the development of tree based grammars. This system includes both (1) a formal language adapted to th...
Yannick Parmentier, Joseph Le Roux, Benoît C...
116
Voted
CADE
2002
Springer
16 years 24 days ago
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
Harald Rueß, Leonardo Mendonça de Mou...