Sciweavers

172 search results - page 8 / 35
» Reducing Behavioural to Structural Properties of Programs wi...
Sort
View
POPL
2009
ACM
14 years 8 months ago
Verifying liveness for asynchronous programs
Asynchronous or "event-driven" programming is a popular technique to efficiently and flexibly manage concurrent interactions. In these programs, the programmer can post ...
Pierre Ganty, Rupak Majumdar, Andrey Rybalchenko
TIFS
2008
183views more  TIFS 2008»
13 years 7 months ago
Blind Authentication Using Periodic Properties of Interpolation
In this paper we analyze and analytically describe the specific statistical changes brought into the covariance structure of signal by the interpolation process. We show that inter...
Babak Mahdian, Stanislav Saic
CC
2008
Springer
172views System Software» more  CC 2008»
13 years 9 months ago
Efficient Context-Sensitive Shape Analysis with Graph Based Heap Models
The performance of heap analysis techniques has a significant impact on their utility in an optimizing compiler. Most shape analysis techniques perform interprocedural dataflow ana...
Mark Marron, Manuel V. Hermenegildo, Deepak Kapur,...
POPL
2006
ACM
14 years 7 months ago
A fixpoint calculus for local and global program flows
We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...
Rajeev Alur, Swarat Chaudhuri, P. Madhusudan
LICS
2003
IEEE
14 years 24 days ago
Model-checking Trace Event Structures
Given a regular collection of Mazurkiewicz traces, which can be seen as the behaviours of a finite-state concurrent system, one can associate with it a canonical regular event st...
P. Madhusudan