Sciweavers

1901 search results - page 356 / 381
» Predicting Program Properties from
Sort
View
105
Voted
VMCAI
2004
Springer
15 years 5 months ago
Boolean Algebra of Shape Analysis Constraints
Shape analysis is a promising technique for statically verifying and extracting properties of programs that manipulate complex data structures. We introduce a new characterization...
Viktor Kuncak, Martin C. Rinard
CTCS
1989
Springer
15 years 4 months ago
Quantitative Domains, Groupoids and Linear Logic
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
Paul Taylor 0002
77
Voted
ICALP
1989
Springer
15 years 4 months ago
Causal Trees
Category theory has been successfully employed to structure the confusing setup of models and equivalences for concurrency: Winskel and Nielsen have related the standard models nc...
Philippe Darondeau, Pierpaolo Degano
ASPLOS
2008
ACM
15 years 2 months ago
Understanding and visualizing full systems with data flow tomography
It is not uncommon for modern systems to be composed of a variety of interacting services, running across multiple machines in such a way that most developers do not really unders...
Shashidhar Mysore, Bita Mazloom, Banit Agrawal, Ti...
111
Voted
RV
2010
Springer
177views Hardware» more  RV 2010»
14 years 10 months ago
Runtime Instrumentation for Precise Flow-Sensitive Type Analysis
We describe a combination of runtime information and static analysis for checking properties of complex and configurable systems. The basic idea of our approach is to 1) let the p...
Etienne Kneuss, Philippe Suter, Viktor Kuncak