Sciweavers

23 search results - page 3 / 5
» Programs with Lists Are Counter Automata
Sort
View
TCS
2008
13 years 6 months ago
Verification of qualitative Z constraints
We introduce an LTL-like logic with atomic formulae built over a constraint language interpreting variables in Z. The constraint language includes periodicity constraints, comparis...
Stéphane Demri, Régis Gascon
CP
2008
Springer
13 years 8 months ago
CPBPV: A Constraint-Programming Framework for Bounded Program Verification
Abstract. This paper studies how to verify the conformity of a program with its specification and proposes a novel constraint-programming framework for bounded program verification...
Hélène Collavizza, Michel Rueher, Pa...
VIROLOGY
2008
121views more  VIROLOGY 2008»
13 years 6 months ago
Constructing malware normalizers using term rewriting
A malware mutation engine is able to transform a malicious program to create a different version of the program. Such mutation engines are used at distribution sites or in self-pro...
Andrew Walenstein, Rachit Mathur, Mohamed R. Chouc...
POPL
2006
ACM
14 years 6 months ago
Polymorphic regular tree types and patterns
We propose a type system based on regular tree grammars, where algebraic datatypes are interpreted in a structural way. Thus, the same constructors can be reused for different typ...
Jerome Vouillon
ITA
2007
153views Communications» more  ITA 2007»
13 years 6 months ago
Deciding inclusion of set constants over infinite non-strict data structures
Abstract. Various static analyses of functional programming languages that permit infinite data structures make use of set constants like Top, Inf, and Bot, denoting all terms, al...
Manfred Schmidt-Schauß, David Sabel, Marko S...