Sciweavers

2482 search results - page 82 / 497
» Characterizing Programming Systems Allowing Program Self-ref...
Sort
View
PLPV
2010
ACM
14 years 5 months ago
Modular reasoning about invariants over shared state with interposed data members
Reasoning about object-oriented programs is difficult since such programs usually involve aliasing, and it is not easy to identify the ways objects can relate to each other and t...
Stephanie Balzer, Thomas R. Gross
ESORICS
2009
Springer
13 years 12 months ago
Declassification with Explicit Reference Points
Noninterference requires that public outputs of a program must be completely independent from secrets. While this ensures that secrets cannot be leaked, it is too restrictive for m...
Alexander Lux, Heiko Mantel
ICLP
1995
Springer
13 years 11 months ago
Experimenting with Nonmonotonic Reasoning
In this paper, we describe a system, called TheoryBase, whose goal is to facilitate experimental studies of nonmonotonic reasoning systems. TheoryBase generates test default theor...
Pawel Cholewinski, V. Wiktor Marek, Artur Mikitiuk...
POPL
2004
ACM
14 years 1 months ago
Summarizing procedures in concurrent programs
The ability to summarize procedures is fundamental to building scalable interprocedural analyses. For sequential programs, procedure summarization is well-understood and used rout...
Shaz Qadeer, Sriram K. Rajamani, Jakob Rehof
FROCOS
2005
Springer
14 years 1 months ago
ATS: A Language That Combines Programming with Theorem Proving
ATS is a language with a highly expressive type system that supports a restricted form of dependent types in which programs are not allowed to appear in type expressions. The langu...
Sa Cui, Kevin Donnelly, Hongwei Xi