Sciweavers

315 search results - page 12 / 63
» Reasoning about Assignments in Recursive Data Structures
Sort
View
196
Voted
POPL
2007
ACM
15 years 12 months ago
Context logic as modal logic: completeness and parametric inexpressivity
Separation Logic, Ambient Logic and Context Logic are based on a similar style of reasoning about structured data. They each consist of a structural (separating) composition for r...
Cristiano Calcagno, Philippa Gardner, Uri Zarfaty
ESANN
2004
15 years 1 months ago
Neural methods for non-standard data
Standard pattern recognition provides effective and noise-tolerant tools for machine learning tasks; however, most approaches only deal with real vectors of a finite and fixed dime...
Barbara Hammer, Brijnesh J. Jain
73
Voted
FMSD
2006
77views more  FMSD 2006»
14 years 11 months ago
Data structures for symbolic multi-valued model-checking
Multi-valued logics can be effectively used to reason about incomplete and/or inconsistent systems, e.g. during early software requirements or as the systems evolve. In our earlie...
Marsha Chechik, Arie Gurfinkel, Benet Devereux, Al...
PLILP
1994
Springer
15 years 3 months ago
Deriving Residual Reference Count Garbage Collectors
We present a strategy to derive an efficient reference count garbage collector for any applicative program by only modifying it on the source code level. The key to the approach is...
Wolfram Schulte
CCS
2006
ACM
15 years 3 months ago
Secure information flow with random assignment and encryption
Type systems for secure information flow aim to prevent a program from leaking information from variables classified as H to variables classified as L. In this work we extend such...
Geoffrey Smith