Sciweavers

159 search results - page 16 / 32
» Specifying Proof Systems in Linear Logic with Subexponential...
Sort
View
ICFP
2007
ACM
16 years 1 months ago
Relating complexity and precision in control flow analysis
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
David Van Horn, Harry G. Mairson
PTS
1998
81views Hardware» more  PTS 1998»
15 years 2 months ago
Testing Temporal Logic Properties in Distributed Systems
Based on the notion of event-based behavioral abstraction EBBA we specify properties of object-oriented distributed systems in linear time temporal logic. These properties are the...
Falk Dietrich, Xavier Logean, Shawn Koppenhoefer, ...
POPL
2006
ACM
16 years 1 months ago
Certified assembly programming with embedded code pointers
Embedded code pointers (ECPs) are stored handles of functions and continuations commonly seen in low-level binaries as well as functional or higher-order programs. ECPs are known ...
Zhaozhong Ni, Zhong Shao
BIRTHDAY
2006
Springer
15 years 5 months ago
Proving Behavioral Refinements of COL-specifications
The COL institution (constructor-based observational logic) has been introduced as a formal framework to specify both generationand observation-oriented properties of software syst...
Michel Bidoit, Rolf Hennicker
PEPM
2010
ACM
15 years 3 months ago
A3PAT, an approach for certified automated termination proofs
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
Evelyne Contejean, Andrey Paskevich, Xavier Urbain...