POPL 2003 - PDF Preprint Papers

POPL 2003 Annual Symposium on Principles of Programming Languages

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed POPL-2003 Paper

click to vote

POPL
2003
ACM

207views Programming Languages» more POPL 2003»

From symptom to cause: localizing errors in counterexample traces

14 years 11 months ago

Download groups.csail.mit.edu

There is significant room for improving users' experiences with model checking tools. An error trace produced by a model checker can be lengthy and is indicative of a symptom...

Thomas Ball, Mayur Naik, Sriram K. Rajamani

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	207	From symptom to cause: localizing errors in counterexample traces	claim
2	149	Toward a foundational typed assembly language	claim
3	139	Pure patterns type systems	claim
4	132	Destructors, finalizers, and synchronization	claim
5	131	Guarded recursive datatype constructors	claim
6	127	New results on the computability and complexity of points - to analysis	claim
7	126	Discovering affine equalities using random interpretation	claim
8	124	Static prediction of heap space usage for first-order functional programs	claim
9	122	Interprocedural compatibility analysis for static object preallocation	claim
10	121	Bitwidth aware global register allocation	claim
11	118	Selective memoization	claim
12	118	Ownership types for object encapsulation	claim
13	112	The essence of XML	claim
14	109	Coercive subtyping for the calculus of constructions	claim
15	108	A type system for higher-order modules	claim
16	107	From control effects to typed continuation passing	claim
17	104	Incremental algorithms for dispatching in dynamically typed languages	claim
18	101	A type theory for memory allocation and data layout	claim
19	99	Environment classifiers	claim
20	97	A real-time garbage collector with low overhead and consistent utilization	claim
21	97	A generic approach to the static analysis of concurrent programs with procedures	claim
22	91	The m-calculus: a higher-order distributed process calculus	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers