2137 search results - page 156 / 428 » Proving Abstract Non-interference |
129
click to vote
PLILP
1993
Springer
15 years 7 months ago
1993
Springer
Abstract. Solving equations in equational theories is a relevant programming paradigm which integrates logic and equational programming into one unified framework. Efficient metho...
148
Voted
COMPSAC
2009
IEEE
15 years 4 months ago
2009
IEEE
Modular certification of low-level intermediate representation (IR) programs is one of the key steps of proof-transforming compilation. The major challenges are lexity of abstract ...
153
click to vote
ICFP
2010
ACM
15 years 4 months ago
2010
ACM
A wide range of computer programs, including compilers and theorem provers, manipulate data structures that involve names and binding. However, the design of programming idioms wh...
142
click to vote
JAIR
2008
15 years 3 months ago
2008
Multi-robot path planning is difficult due to the combinatorial explosion of the search space with every new robot added. Complete search of the combined state-space soon intracta...
107
click to vote
JSS
2008
15 years 3 months ago
2008
Search-based test-data generation has proved successful for code-level testing but almost no search-based work has been carried out at evels of abstraction. In this paper the appl...