[PDF][PDF] Overview of Thirty Semantic Formalisms for Reo.

SSTQ Jongmans, F Arbab - Scientific Annals of Computer Science, 2012 - info.uaic.ro
Over the past decades, coordination languages have emerged for the specification and
implementation of interaction protocols for communicating software components. This class …

Puff, the magic protocol

F Arbab - Formal Modeling: Actors, Open Systems, Biological …, 2011 - Springer
Traditional models of concurrency resort to peculiarly indirect means to express interaction
and study its properties. Formalisms such as process algebras/calculi, concurrent objects …

Fault-based test suite prioritization for specification-based testing

YT Yu, MF Lau - Information and Software Technology, 2012 - Elsevier
CONTEXT: Existing test suite prioritization techniques usually rely on code coverage
information or historical execution data that serve as indicators for estimating the fault …

Connectors as designs: Modeling, refinement and test case generation

S Meng, F Arbab, BK Aichernig, L Aştefănoaei… - Science of Computer …, 2012 - Elsevier
Over the past years, the need for high-confidence coordination mechanisms has intensified
as new technologies have appeared for the development of service-oriented applications …

Passive conformance testing of service choreographies

HN Nguyen, P Poizat, F Zaïdi - Proceedings of the 27th Annual ACM …, 2012 - dl.acm.org
Choreography supports the specification, with a global perspective, of the interactions
between the roles played by partners in a collaboration. These roles are the basis for the …

Reasoning about connectors in coq

X Zhang, W Hong, Y Li, M Sun - International Workshop on Formal Aspects …, 2016 - Springer
Reo is a channel-based exogenous coordination model in which complex coordinators,
called connectors, are compositionally built out of simpler ones. In this paper, we present a …

Generating distinguishing tests using the minion constraint solver

F Wotawa, M Nica, BK Aichernig - 2010 Third International …, 2010 - ieeexplore.ieee.org
We discuss the generation of test cases for demonstrating the non-equivalence of two
programs. This problem has applications in mutation testing and automated debugging …

[HTML][HTML] Modeling and verification of component connectors in Coq

Y Li, M Sun - Science of Computer Programming, 2015 - Elsevier
Connectors have emerged as a powerful concept for composition and coordination of
concurrent activities encapsulated as components and services. Compositional coordination …

Modified montgomery modular multiplication using 4: 2 compressor and CSA adder

H Thapliyal, A Ramasahayam, VK Kotha… - … on Electronic Design …, 2006 - ieeexplore.ieee.org
The efficiency of the public key encryption systems like RSA and ECC can be improved with
the adoption of a faster multiplication scheme. In this paper, Modified Montgomery …

[HTML][HTML] Reasoning about connectors using Coq and Z3

X Zhang, W Hong, Y Li, M Sun - Science of Computer Programming, 2019 - Elsevier
Reo is a channel-based exogenous coordination language in which complex coordinators,
called connectors, are compositionally built out of simpler ones. In this paper, we present an …