Sciweavers

144 search results - page 12 / 29
» How Expressions Can Code for Automata
Sort
View
117
Voted
SP
2008
IEEE
162views Security Privacy» more  SP 2008»
15 years 8 days ago
Fable: A Language for Enforcing User-defined Security Policies
This paper presents FABLE, a core formalism for a programming language in which programmers may specify security policies and reason that these policies are properly enforced. In ...
Nikhil Swamy, Brian J. Corcoran, Michael Hicks
POPL
2002
ACM
16 years 21 days ago
Proving correctness of compiler optimizations by temporal logic
Many classical compiler optimizations can be elegantly expressed using rewrite rules of form: I = I if , where I, I are intermediate language instructions and is a property expre...
David Lacey, Neil D. Jones, Eric Van Wyk, Carl Chr...
WCRE
2003
IEEE
15 years 5 months ago
RegReg: a Lightweight Generator of Robust Parsers for Irregular Languages
In reverse engineering, parsing may be partially done to extract lightweight source models. Parsing code containing preprocessing directives, syntactical errors and embedded langu...
Mario Latendresse
100
Voted
RSP
2003
IEEE
169views Control Systems» more  RSP 2003»
15 years 5 months ago
Rapid Prototyping and Incremental Evolution Using SLAM
The paper shows the outlines of the SLAM system and how its design is suitable for automating rapid prototyping. The system includes a very expressive object oriented specificati...
Ángel Herranz-Nieva, Juan José Moren...
EMSOFT
2006
Springer
15 years 4 months ago
An analysis framework for network-code programs
Distributed real-time systems require a predictable and verifiable mechanism to control the communication medium. Current real-time communication protocols are typically independe...
Madhukar Anand, Sebastian Fischmeister, Insup Lee