Sciweavers

553 search results - page 9 / 111
» Verified, Executable Parsing
Sort
View
POPL
2009
ACM
14 years 9 months ago
Verifying liveness for asynchronous programs
Asynchronous or "event-driven" programming is a popular technique to efficiently and flexibly manage concurrent interactions. In these programs, the programmer can post ...
Pierre Ganty, Rupak Majumdar, Andrey Rybalchenko
ECAI
2010
Springer
13 years 10 months ago
Verifying Properties of Infinite Sequences of Description Logic Actions
The verification problem for action logic programs with non-terminating behaviour is in general undecidable. In this paper, we consider a restricted setting in which the problem be...
Franz Baader, Hongkai Liu, Anees ul Mehdi
DIMVA
2004
13 years 10 months ago
Structural Comparison of Executable Objects
: A method to heuristically construct an isomorphism between the sets of functions in two similar but differing versions of the same executable file is presented. Such an isomorphi...
Halvar Flake
LACL
1998
Springer
14 years 1 months ago
Sequential Construction of Logical Forms
In this paper we give a formal description of the parsing model that underlies the treatment of Long Distance Dependencies, Topic and Focus, Ellipsis and Quantification in, amongs...
Wilfried Meyer-Viol
DAC
1997
ACM
14 years 12 days ago
Formal Verification of a Superscalar Execution Unit
Abstract. Many modern systems are designed as a set of interconnected reactive subsystems. The subsystem verification task is to verify an implementation of the subsystem against t...
Kyle L. Nelson, Alok Jain, Randal E. Bryant