Complex software systems typically involve features like time, concurrency and probability, where probabilistic computations play an increasing role. It is challenging to formaliz...
Huibiao Zhu, Shengchao Qin, Jifeng He, Jonathan P....
— With the success of formal verification techniques like equivalence checking and model checking for hardware designs, there has been growing interest in applying such techniqu...
Franjo Ivancic, Ilya Shlyakhter, Aarti Gupta, Mala...
The existing call-by-need λ calculi describe lazy evaluation via equational logics. A programmer can use these logics to safely ascertain whether one term is behaviorally equivale...
Abstract. The concept of unreliable failure detectors for reliable distributed systems was introduced by Chandra and Toueg as a fine-grained means to add weak forms of synchrony i...
We give a formal account of a calculus for modeling service-based systems, suitable to describe both service composition (orchestration) and the protocol that services run when in...
Ivan Lanese, Francisco Martins, Vasco Thudichum Va...