Sciweavers

213 search results - page 23 / 43
» A framework for checking proofs naturally
Sort
View
ENTCS
2006
189views more  ENTCS 2006»
13 years 7 months ago
Variables as Resource for Shared-Memory Programs: Semantics and Soundness
Parkinson, Bornat, and Calcagno recently introduced a logic for partial correctness in which program variables are treated as resource, generalizing earlier work based on separati...
Stephen D. Brookes
MODELS
2007
Springer
14 years 1 months ago
A Metamodel-Based Approach for Analyzing Security-Design Models
Abstract We have previously proposed an expressive UML-based language for constructing and transforming security-design models, which are models that combine design specifications...
David A. Basin, Manuel Clavel, Jürgen Doser, ...
ENTCS
2008
137views more  ENTCS 2008»
13 years 7 months ago
Computerizing Mathematical Text with MathLang
Mathematical texts can be computerized in many ways that capture differing amounts of the mathematical meaning. At one end, there is document imaging, which captures the arrangeme...
Fairouz Kamareddine, J. B. Wells
POPL
2009
ACM
14 years 8 months ago
Types and higher-order recursion schemes for verification of higher-order programs
We propose a new verification method for temporal properties of higher-order functional programs, which takes advantage of Ong's recent result on the decidability of the mode...
Naoki Kobayashi
BPM
2006
Springer
108views Business» more  BPM 2006»
13 years 11 months ago
Measuring Performance in the Retail Industry (Position Paper)
Bearing in mind the changeable and complicated needs of business environment, in this paper we examine the necessity of evolution in the traditional decision support techniques. Ou...
Gerasimos Marketos, Yannis Theodoridis