Sciweavers

1912 search results - page 145 / 383
» GOAL as a Planning Formalism
Sort
View
SAS
2009
Springer
175views Formal Methods» more  SAS 2009»
16 years 7 months ago
Automatic Parallelization and Optimization of Programs by Proof Rewriting
We show how, given a program and its separation logic proof, one can parallelize and optimize this program and transform its proof simultaneously to obtain a proven parallelized an...
Clément Hurlin
ISOLA
2010
Springer
15 years 4 months ago
Task Forces in the EternalS Coordination Action
We describe the scope, organization, and expected outcomes of the Task Forces of the EternalS Coordination Action. The goal of the Task Forces is to provide structure and focus to ...
Reiner Hähnle
ISICT
2003
15 years 7 months ago
Analysis of a mobile communication security protocol
: Cryptographic protocols are used to achieve secure communication over insecure networks. Weaknesses in such protocols are hard to identify, as they can be the result of subtle de...
Tom Coffey, Reiner Dojen
SIGMOD
2001
ACM
158views Database» more  SIGMOD 2001»
16 years 6 months ago
Generating Efficient Plans for Queries Using Views
We study the problem of generating e cient, equivalent rewritings using views to compute the answer to a query. We take the closed-world assumption, in which views are materialize...
Foto N. Afrati, Chen Li, Jeffrey D. Ullman
COMPSAC
1999
IEEE
15 years 10 months ago
Detecting Null Pointer Violations in Java Programs
The use of formal methods has been growing steadily and there have been a number of successful applications of formal methods in a range of application areas. It seems agreed that...
Xiaoping Jia, Sushant Sawant, Jiangyu Zhou, Sotiri...