3658 search results - page 554 / 732 » The logic of proofs, semantically |
180
click to vote
FOAL
2009
ACM
16 years 1 months ago
2009
ACM
We present a programming language model of the ideas behind Functional Adaptive Programming (AP-F) and our Java implementation, DemeterF. Computation in AP-F is encapsulated in se...
162
click to vote
FASE
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. Abstraction is essential in the formal specification of programs. A common way of writing abstract specifications is to specify implementations in terms of basic mathem...
191
click to vote
ASWEC
2007
IEEE
16 years 26 days ago
2007
IEEE
Behavior Trees (BTs) are a graphical notation used for formalising functional requirements and have been successfully applied to several case studies. However, the notation curren...
158
click to vote
ESORICS
2007
Springer
16 years 21 days ago
2007
Springer
A formal treatment to the privacy of concealed data aggregation (CDA) is given. While there exist a handful of constructions, rigorous security models and analyses for CDA are stil...
138
click to vote
FSTTCS
2005
Springer
16 years 1 days ago
2005
Springer
We extend Howe’s method to prove that input-early strong and -delay contextual bisimulations are congruences for the Higher-order mobile embedded resources (Homer) calculus, a ty...