Sciweavers

101 search results - page 11 / 21
» Error Correcting Analysis for Tree Languages
Sort
View
LPAR
2001
Springer
13 years 12 months ago
Boolean Functions for Finite-Tree Dependencies
Several logic-based languages, such as Prolog II and its successors, SICStus Prolog and Oz, offer a computation domain including rational trees. Infinite rational trees allow fo...
Roberto Bagnara, Enea Zaffanella, Roberta Gori, Pa...
POPL
2010
ACM
14 years 4 months ago
Dynamically Checking Ownership Policies in Concurrent C/C++ Programs
Concurrent programming errors arise when threads share data incorrectly. Programmers often avoid these errors by using synchronization to enforce a simple ownership policy: data i...
Jean-Phillipe Martin, Michael Hicks, Manuel Costa,...
ACSAC
1999
IEEE
13 years 11 months ago
Using Checkable Types in Automatic Protocol Analysis
The Automatic Authentication Protocol Analyzer, 2nd Version AAPA2 is a fast, completely automatic tool for formally analyzing cryptographic protocols. It correctly identi es vulne...
Stephen H. Brackin
RTA
2007
Springer
14 years 1 months ago
Rewriting Approximations for Fast Prototyping of Static Analyzers
This paper shows how to construct static analyzers using tree automata and rewriting techniques. Starting from a term rewriting system representing the operational semantics of the...
Yohan Boichut, Thomas Genet, Thomas P. Jensen, Luk...
RE
2008
Springer
13 years 7 months ago
Generating Natural Language specifications from UML class diagrams
Early phases of software development are known to be problematic, difficult to manage and errors occurring during these phases are expensive to correct. Many systems have been deve...
Farid Meziane, Nikos Athanasakis, Sophia Ananiadou