Sciweavers

Share
TACAS
2009
Springer
144views Algorithms» more  TACAS 2009»
9 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, ...
TACAS
2009
Springer
212views Algorithms» more  TACAS 2009»
10 years 1 months ago
Semantic Reduction of Thread Interleavings in Concurrent Programs
Abstract. We propose a static analysis framework for concurrent programs based on reduction of thread interleavings using sound invariants on the top of partial order techniques. S...
Vineet Kahlon, Sriram Sankaranarayanan, Aarti Gupt...
TACAS
2009
Springer
128views Algorithms» more  TACAS 2009»
10 years 1 months ago
All-Termination(T)
We introduce the All-Termination(T) problem: given a termination solver, T, and a program (a set of functions), find every set of formal arguments whose consideration is sufficie...
Panagiotis Manolios, Aaron Turon
TACAS
2009
Springer
207views Algorithms» more  TACAS 2009»
10 years 1 months ago
RBAC-PAT: A Policy Analysis Tool for Role Based Access Control
Abstract. Role-Based Access Control (RBAC) has been widely used for expressing access control policies. Administrative Role-Based Access Control (ARBAC) specifies how an RBAC poli...
Mikhail I. Gofman, Ruiqi Luo, Ayla C. Solomon, Yin...
TACAS
2009
Springer
134views Algorithms» more  TACAS 2009»
10 years 1 months ago
Computing Weakest Strategies for Safety Games of Imperfect Information
CEDAR (Counter Example Driven Antichain Refinement) is a new symbolic algorithm for computing weakest strategies for safety games of imperfect information. The algorithm computes ...
Wouter Kuijper, Jaco van de Pol
TACAS
2009
Springer
167views Algorithms» more  TACAS 2009»
10 years 1 months ago
ITPN-PerfBound: A Performance Bound Tool for Interval Time Petri Nets
The ITPN-PerfBound is a tool for the modeling and analysis of Interval Time Petri Nets (ITPN), that is Petri Nets in which firing time intervals, and possibly firing frequency in...
Elina Pacini Naumovich, Simona Bernardi, Marco Gri...
TACAS
2009
Springer
127views Algorithms» more  TACAS 2009»
10 years 1 months ago
From Tests to Proofs
We describe the design and implementation of an automatic invariant generator for imperative programs. While automatic invariant generation through constraint solving has been exte...
Ashutosh Gupta, Rupak Majumdar, Andrey Rybalchenko
TACAS
2009
Springer
95views Algorithms» more  TACAS 2009»
10 years 1 months ago
Specification Mining with Few False Positives
Claire Le Goues, Westley Weimer
TACAS
2009
Springer
136views Algorithms» more  TACAS 2009»
10 years 1 months ago
Path Feasibility Analysis for String-Manipulating Programs
We discuss the problem of path feasibility for programs manipulating strings using a collection of standard string library functions. We prove results on the complexity of this pro...
Nikolaj Bjørner, Nikolai Tillmann, Andrei V...
TACAS
2009
Springer
135views Algorithms» more  TACAS 2009»
10 years 1 months ago
Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads
Context-bounded analysis has been shown to be both efficient and effective at finding bugs in concurrent programs. According to its original definition, context-bounded analysis...
Mohamed Faouzi Atig, Ahmed Bouajjani, Shaz Qadeer
books