632 search results - page 65 / 127 » Proving Invariants of Functional Programs |
107
click to vote
ESOP
2001
Springer
15 years 5 months ago
2001
Springer
We check statically whether it is safe for untrusted foreign machine code to be loaded into a trusted host system. (Here “safety” means that the program abides by a memory-acc...
101
Voted
HYBRID
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. A methodology for safety verification using barrier certificates has been proposed recently. Conditions that must be satisfied by a barrier certificate can be formula...
126
click to vote
SODA
2010
ACM
15 years 10 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
96
Voted
TCS
2008
15 years 14 days ago
2008
The replication number of a branching program is the minimum number R such that along every accepting computation at most R variables are tested more than once; the sets of variab...
103
click to vote
PPOPP
1993
ACM
15 years 4 months ago
1993
ACM
The ParaScope Editor is an interactive parallel programming tool that assists knowledgeable users in developing scienti c Fortran programs. It displays the results of sophisticate...