Sciweavers

1452 search results - page 86 / 291
» Algorithmic Analysis of Array-Accessing Programs
Sort
View
APLAS
2011
ACM
14 years 11 days ago
Solving Recursion-Free Horn Clauses over LI+UIF
Verification of programs with procedures, multi-threaded programs, and higher-order functional programs can be effectively auusing abstraction and refinement schemes that rely o...
Ashutosh Gupta, Corneliu Popeea, Andrey Rybalchenk...
ICRA
1993
IEEE
118views Robotics» more  ICRA 1993»
15 years 4 months ago
Hip Implant Insertability Analysis: A Medical Instance of the Peg-In-Hole Problem
cavity Recent advan.cesin cementless hip replacement surgery have significantly improved the accuracy of bone cavity preparation and custom implant shape design. With the increased...
Leo Joskowicz, Russell H. Taylor
IWMM
2007
Springer
85views Hardware» more  IWMM 2007»
15 years 6 months ago
Uniqueness inference for compile-time object deallocation
This paper presents an analysis and transformation for individual object reclamation in Java programs. First, we propose a uniqueness inference algorithm that identifies variable...
Sigmund Cherem, Radu Rugina
TACAS
2005
Springer
78views Algorithms» more  TACAS 2005»
15 years 5 months ago
Separating Fairness and Well-Foundedness for the Analysis of Fair Discrete Systems
Fair discrete systems (FDSs) are a computational model of concurrent programs where fairness assumptions are specified in terms of sets of states. The analysis of fair discrete sy...
Amir Pnueli, Andreas Podelski, Andrey Rybalchenko
SAC
2009
ACM
15 years 7 months ago
Response time analysis of software transactional memory-based distributed real-time systems
We consider distributed real-time systems where concurrency control is managed using software transactional memory. For such a method we propose an algorithm to compute an upper b...
Sherif Fadel Fahmy, Binoy Ravindran, E. Douglas Je...