Sciweavers

5015 search results - page 645 / 1003
» Model Checking a Path
Sort
View
TACAS
2009
Springer
144views Algorithms» more  TACAS 2009»
15 years 11 months ago
Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints
Abstract. We present a method which computes optimized representations for non-convex polyhedra. Our method detects so-called redundant linear constraints in these representations ...
Christoph Scholl, Stefan Disch, Florian Pigorsch, ...
FSTTCS
2001
Springer
15 years 11 months ago
Computability and Complexity Results for a Spatial Assertion Language for Data Structures
Abstract. This paper studies a recently developed an approach to reasoning about mutable data structures, which uses an assertion language with spatial conjunction and implication ...
Cristiano Calcagno, Hongseok Yang, Peter W. O'Hear...
181
Voted
PPDP
2001
Springer
15 years 11 months ago
Trust in the Pi-Calculus
We introduce a new system of trust analysis for concurrent and distributed systems using the π-calculus[13, 14, 15] as a modelling tool. A Type system using boolean annotations g...
Mark Hepburn, David Wright
LCPC
1999
Springer
15 years 11 months ago
Instruction Scheduling in the Presence of Java's Runtime Exceptions
One of the challenges present to a Java compiler is Java’s frequent use of runtime exceptions. These exceptions affect performance directly by requiring explicit checks, as wel...
Matthew Arnold, Michael S. Hsiao, Ulrich Kremer, B...
ECOOP
1998
Springer
15 years 11 months ago
Flexible Alias Protection
Aliasing is endemic in object oriented programming. Because an object can be modified via any alias, object oriented programs are hard to understand, maintain, and analyse. Flexibl...
James Noble, Jan Vitek, John Potter