1497 search results - page 277 / 300 » Extended static checking |
SIGSOFT
2007
ACM
14 years 9 months ago
2007
ACM
Automated verification is a technique for establishing if certain properties, usually expressed in temporal logic, hold for a system model. The model can be defined using a high-l...
POPL
2008
ACM
14 years 9 months ago
2008
ACM
Communication is becoming one of the central elements in software development. As a potential typed foundation for structured communication-centred programming, session types have...
POPL
2003
ACM
14 years 9 months ago
2003
ACM
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...
STOC
2006
ACM
14 years 9 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
POPL
2010
ACM
14 years 6 months ago
2010
ACM
We introduce higher-order, multi-parameter, tree transducers (HMTTs, for short), which are kinds of higher-order tree transducers that take input trees and output a (possibly infi...