2540 search results - page 269 / 508 » Abstract Logics as Dialgebras |
202
click to vote
CADE
2011
Springer
14 years 24 days ago
2011
Springer
Abstract. Security protocols aim at securing communications over public networks. Their design is notoriously difficult and error-prone. Formal methods have shown their usefulness ...
129
Voted
POPL
2012
ACM
13 years 8 months ago
2012
ACM
Functional reactive programming (FRP) is an elegant and successful approach to programming reactive systems declaratively. The high levels of abstraction and expressivity that mak...
117
Voted
CAV
2012
Springer
13 years 3 months ago
2012
Springer
Abstract. A minimum satisfying assignment of a formula is a minimumcost partial assignment of values to the variables in the formula that guarantees the formula is true. Minimum sa...
141
Voted
CADE
2012
Springer
13 years 3 months ago
2012
Springer
Abstract. This paper describes a novel decision procedure for quantifierfree linear integer arithmetic. Standard techniques usually relax the initial problem to the rational domai...
81
Voted
CORR
2007
Springer
15 years 24 days ago
2007
Springer
nalysis of logic programs, abstract domains for detecting sharing and linearity ion are widely used. Devising abstract unification algorithms for such domains has proved to be ra...