biblio/compositional.bib

QuickSearch:   Number of matching entries: 0.

Search Settings

Author	Title	Year	Journal/Proceedings	Reftype	DOI/URL
Adler, B., de Alfaro, L., da Silva, L.D., Faella, M., Legay, A., Raman, V. & Roy, P. Thomas Ball and Robert B. Jones (Ed.)	Ticc: A Tool for Interface Compatibility and Composition. [BibTeX]	2006	Vol. 4144CAV'06: Proceedings of 18th International Conference of Computer Aided Verification, pp. 59-62	inproceedings
BibTeX: @inproceedings{alder06ticc, author = {B.T.~Adler and L.~de Alfaro and L.~Dias da Silva and M.~Faella and A.~Legay and V.~Raman and P.~Roy}, title = {Ticc: A Tool for Interface Compatibility and Composition.}, booktitle = {CAV'06: Proceedings of 18th International Conference of Computer Aided Verification}, year = {2006}, volume = {4144}, pages = {59-62} }
Amla, N., Emerson, E.A., Namjoshi, K.S. & Trefler, R.J.	Assume-Guarantee Based Compositional Reasoning for Synchronous Timing Diagrams [BibTeX]	2001	TACAS 2001: Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pp. 465-479	inproceedings
BibTeX: @inproceedings{amla01assume, author = {N.~Amla and E.~A.~Emerson and K.~S.~Namjoshi and R.~J.~Trefler}, title = {Assume-Guarantee Based Compositional Reasoning for Synchronous Timing Diagrams}, booktitle = {TACAS 2001: Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems}, publisher = {Springer-Verlag}, year = {2001}, pages = {465--479} }
Cabodi, G., Camurati, P., Garcia, L., Murciano, M., Nocco, S. & Quer, S.	Speeding up Model Checking by Exploiting Explicit and Hidden Verification Constraints [BibTeX]	2009	DATE '09: Proceedings of the conference on Design, Automation and Test in Europe, pp. 1686-1691	inproceedings
BibTeX: @inproceedings{Cabodi09Speeding, author = {G. Cabodi and P. Camurati and L. Garcia and M. Murciano and S. Nocco and S. Quer}, title = {Speeding up Model Checking by Exploiting Explicit and Hidden Verification Constraints}, booktitle = {DATE '09: Proceedings of the conference on Design, Automation and Test in Europe}, year = {2009}, pages = {1686-1691} }
Cansell, D. & Méry, D. S. Gilmore and M. Ryan (Ed.)	Abstraction and Refinement of Features [Abstract] [BibTeX]	2001	Language Constructs for Designing Features, pp. 65-84	incollection
Abstract: The composition of services and features often leads to unwanted situations, because it is a non-monotonic operation over services and features. When a new service is added to an existing system, conditions have to be checked to ensure that the resulting system satisfies a list of required properties. Following the system approach of Abrial, we develop services and features in an incremental way and use refinement to model the composition of services and features. Proof obligations state the preservation or the non-preservation of properties, namely invariant or more generally safety properties. The method helps us in understanding when a service is interfering with another, and allows us to give multiple views of each service according to the level of its refinement. Finally, we validate our method with the Atelier B tool.
BibTeX: @incollection{Cansell2001AbstractionandRefinementofFeatures, author = {D.~Cansell and D.~Méry}, title = {Abstraction and Refinement of Features}, booktitle = {Language Constructs for Designing Features}, publisher = {Springer-Verlag}, year = {2001}, pages = {65--84} }
Clarke, E.M., Long, D.E. & McMillan, K.L.	Compositional Model Checking [BibTeX]	1989	LICS'89: Proceedings of the 4th Annual Symposium on Logic in Computer Science, pp. 353-362	inproceedings
BibTeX: @inproceedings{DBLP:conf/lics/ClarkeLM89, author = {E.~M.~Clarke and D.~E.~Long and K.~L.~McMillan}, title = {Compositional Model Checking}, booktitle = {LICS'89: Proceedings of the 4th Annual Symposium on Logic in Computer Science}, publisher = {IEEE Computer Society}, year = {1989}, pages = {353-362} }
Feng, Y., Veeramani, A., Kanagasabai, R. & Rho, S.	Automatic Service Composition via Model Checking [Abstract] [BibTeX]	2011	Services Computing Conference (APSCC), 2011 IEEE Asia-Pacific, pp. 477 -482	inproceedings	DOI
Abstract: Web service composition is the process of constructing a set of Web services which, when invoked with some user input in a particular order, can produce the output to the user's requirements. This paper proposes a novel model checking based approach for automated service composition. Modeling services as a set of interleaved processes in a class of process algebra, we formulate service composition as model checking asserted on a specific type of property on the model. We show that, under this formulation, correct composition workflows can be constructed from the counter-examples provided by model checking. With a case study on online hotel booking services, we demonstrate that the proposed approach can support directed a cyclic composition graphs and the generated composition graphs are automatically verified.
BibTeX: @inproceedings{6128043, author = {Yuzhang Feng and Veeramani, A. and Kanagasabai, R. and Seungmin Rho}, title = {Automatic Service Composition via Model Checking}, booktitle = {Services Computing Conference (APSCC), 2011 IEEE Asia-Pacific}, year = {2011}, pages = {477 -482}, doi = {http://dx.doi.org/10.1109/APSCC.2011.54} }
Jhala, R. & McMillan, K. Alain Finkel Gérard Berry, Hubert Comon (Ed.)	Microarchitecture Verification by Compositional Model Checking. [BibTeX]	2001	Vol. 2102CAV'01: Proceedings of the 13th International Conference on Computer Aided Verification, pp. 396-410	inproceedings
BibTeX: @inproceedings{jhala01microarchi, author = {Jhala, R. and McMillan, K.L.}, title = {Microarchitecture Verification by Compositional Model Checking.}, booktitle = {CAV'01: Proceedings of the 13th International Conference on Computer Aided Verification}, publisher = {Springer}, year = {2001}, volume = {2102}, pages = {396-410} }
Li, J., Sun, X., Xie, F. & Song, X. Hong Mei (Ed.)	Component-Based Abstraction and Refinement [BibTeX]	2008	Vol. 5030High Confidence Software Reuse in Large Systems, pp. 39-51	incollection	URL
BibTeX: @incollection{springerlink:10.1007/978-3-540-68073-4_4, author = {Li, Juncao and Sun, Xiuli and Xie, Fei and Song, Xiaoyu}, title = {Component-Based Abstraction and Refinement}, booktitle = {High Confidence Software Reuse in Large Systems}, publisher = {Springer Berlin / Heidelberg}, year = {2008}, volume = {5030}, pages = {39-51}, note = {10.1007/978-3}, url = {http://dx.doi.org/10.1007/978-3-540-68073-4_4} }
Lomuscio, A., Strulo, B., Walker, N. & Wu, P. Jin Dong and Huibiao Zhu (Ed.)	Assume-Guarantee Reasoning with Local Specifications [Abstract] [BibTeX]	2010	Vol. 6447Formal Methods and Software Engineering, pp. 204-219	incollection	URL
Abstract: We investigate assume-guarantee reasoning for global specifications consisting of conjunctions of local specifications. We present a sound and complete assume-guarantee rule that permits reasoning about individual modules for local specifications and draws conclusions on global specifications. We illustrate our approach with an example from the field of network congestion control, where different agents are responsible for controlling packet flow across a shared infrastructure. In this context, we derive an assume-guarantee rule for system stability, and show that this rule is valuable to reason about any number of agents, any initial flow configuration, and any topology of bounded degree.
BibTeX: @incollection{springerlink:10.1007/978-3-642-16901-4_15, author = {Lomuscio, Alessio and Strulo, Ben and Walker, Nigel and Wu, Peng}, title = {Assume-Guarantee Reasoning with Local Specifications}, booktitle = {Formal Methods and Software Engineering}, publisher = {Springer Berlin / Heidelberg}, year = {2010}, volume = {6447}, pages = {204-219}, note = {10.1007/978-3-642-16901-4_15}, url = {http://dx.doi.org/10.1007/978-3-642-16901-4_15} }
Long, D.E.	Model Checking, Abstraction, and Compositional Verification [BibTeX]	1993	School: Carnegie Mellon University	phdthesis
BibTeX: @phdthesis{long93thesis, author = {D.~E.~Long}, title = {Model Checking, Abstraction, and Compositional Verification}, school = {Carnegie Mellon University}, year = {1993} }
McMillan, K. Moshe Y. Vardi Alan J. Hu (Ed.)	Verification of an Implementation of Tomasulo's Algorithm by Compositional Model Checking. [BibTeX]	1998	Vol. 1427CAV'98: Proceddings of the 10th International Conference on Computer Aided Verification, pp. 110-121	inproceedings
BibTeX: @inproceedings{mcmillan98tomasulo, author = {K.L.~McMillan}, title = {Verification of an Implementation of Tomasulo's Algorithm by Compositional Model Checking.}, booktitle = {CAV'98: Proceddings of the 10th International Conference on Computer Aided Verification}, publisher = {Springer}, year = {1998}, volume = {1427}, pages = {110-121} }
McMillan, K.	A Methodology for Hardware Verification Using Compositional Model Checking [BibTeX]	2000	Science of Computer Programming Vol. 37(1-3), pp. 279-309	article	URL
BibTeX: @article{mcmillan00methodology, author = {K.L. McMillan}, title = {A Methodology for Hardware Verification Using Compositional Model Checking}, journal = {Science of Computer Programming}, year = {2000}, volume = {37}, number = {1--3}, pages = {279--309}, url = {citeseer.ist.psu.edu/mcmillan99methodology.html} }
McMillan, K.L. Orna Grumberg (Ed.)	A Compositional Rule for Hardware Design Refinement. [BibTeX]	1997	Vol. 1254CAV'97: Proceedings of the 9th International Conference on Computer Aided Verification, pp. 24-35	inproceedings
BibTeX: @inproceedings{DBLP:conf/cav/McMillan97, author = {Kenneth L. McMillan}, title = {A Compositional Rule for Hardware Design Refinement.}, booktitle = {CAV'97: Proceedings of the 9th International Conference on Computer Aided Verification}, publisher = {Springer}, year = {1997}, volume = {1254}, pages = {24-35} }
Peng, H.	Improving Compositional Verification through Environment Synthesis and Syntactic Model Reduction [BibTeX]	2002	School: Dept. of Electrical and Computer Engenering, Concordia University, Montreal, Quebec, Canada	phdthesis
BibTeX: @phdthesis{peng02thesis, author = {H.~Peng}, title = {Improving Compositional Verification through Environment Synthesis and Syntactic Model Reduction}, school = {Dept. of Electrical and Computer Engenering, Concordia University, Montreal, Quebec, Canada}, year = {2002} }
Peng, H., Mokhtari, Y. & Tahar, S.	Environment Synthesis for Compositional Model Checking. [BibTeX]	2002	ICCD'02: Proceedings of the 20th International Conference on Computer Design, pp. 70-	inproceedings
BibTeX: @inproceedings{peng02tableau, author = {H.~Peng and Y.~Mokhtari and S.~Tahar}, title = {Environment Synthesis for Compositional Model Checking.}, booktitle = {ICCD'02: Proceedings of the 20th International Conference on Computer Design}, publisher = {IEEE Computer Society}, year = {2002}, pages = {70-} }
Tripakis, S., Andrade, H., Ghosal, A., Limaye, R., Ravindran, K., Wang, G., Yang, G., Kormerup, J. & Wong, I.	Correct and non-defensive glue design using abstract models [Abstract] [BibTeX]	2011	Proceedings of the seventh IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis, pp. 59-68	inproceedings	DOI URL
Abstract: Current hardware design practice often relies on integration of components, some of which may be IP or legacy blocks. While integration eases design by allowing modularization and component reuse, it is still done in a mostly ad hoc manner. Designers work with descriptions of components that are either informal or incomplete (e.g., documents in English, structural but non-behavioral specifications in IP-XACT) or too low-level (e.g., HDL code), and have little to no automatic support for stitching the components together. Providing such support is the glue design problem. This paper addresses this problem using a model-based approach. The key idea is to use high-level models, such as dataflow graphs, that enable efficient automated analysis. The analysis can be used to derive performance properties of the system (e.g., component compatibility, throughput, etc.), optimize resource usage (e.g., buffer sizes), and even synthesize low-level code (e.g., control logic). However, these models are only abstractions of the real system, and often omit critical information. As a result, the analysis outcomes may be defensive (e.g., buffers that are too big) or even incorrect (e.g., buffers that are too small). The paper examines these situations and proposes a correct and non-defensive design methodology that employs the right models to explore accurate performance and resource trade-offs.
BibTeX: @inproceedings{Tripakis201, author = {Tripakis, Stavros and Andrade, Hugo and Ghosal, Arkadeb and Limaye, Rhishikesh and Ravindran, Kaushik and Wang, Guoqiang and Yang, Guang and Kormerup, Jacob and Wong, Ian}, title = {Correct and non-defensive glue design using abstract models}, booktitle = {Proceedings of the seventh IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis}, publisher = {ACM}, year = {2011}, pages = {59--68}, url = {http://doi.acm.org/10.1145/2039370.2039382}, doi = {http://doi.acm.org/10.1145/2039370.2039382} }
Xie, F. & Browne, J.	Verified Systems by Composition from Verified Components [BibTeX]	2003	ESEC/FSE 2003 : Proceedings of the 11th ACM SIGSOFT Symposium on Foundations of Software Engineering 2003 held jointly with 9th European Software Engineering Conference, pp. 277-286	inproceedings	DOI
BibTeX: @inproceedings{xie03verified, author = {F.~Xie and J.C.~Browne}, title = {Verified Systems by Composition from Verified Components}, booktitle = {ESEC/FSE 2003 : Proceedings of the 11th ACM SIGSOFT Symposium on Foundations of Software Engineering 2003 held jointly with 9th European Software Engineering Conference}, publisher = {ACM Press}, year = {2003}, pages = {277--286}, doi = {http://doi.acm.org/10.1145/940071.940109} }
Zheng, H., Yao, H. & Yoneda, T.	Modular Model Checking of Large Asynchronous Designs with Efficient Abstraction Refinement [Abstract] [Review] [BibTeX]	2010	Computers, IEEE Transactions on Vol. 59(4), pp. 561 -573	article	DOI
Abstract: Divide-and-conquer is essential to address state explosion in model checking. Verifying each individual component in a system, in isolation, efficiently requires an appropriate context, which traditionally is obtained by hand. This paper presents an efficient modular model checking approach for asynchronous design verification. It is equipped with a novel abstraction refinement method that can refine a component abstraction to be accurate enough for successful verification. It is fully automated, and eliminates the need of finding an accurate context when verifying each individual component, although such a context is still highly desirable. This method is also enhanced with additional state space reduction techniques. The experiments on several nontrivial asynchronous designs show that this method efficiently removes impossible behaviors from each component including ones violating correctness requirements.
Review: Verification of a whole system by verifying each components. When verifying each components individually assumptions has to be made on the environnment ot avoid false counter-examples. Use component abstraction to over-approximated the environment. This abastraction must be refined to obtain only the behavior allowed at the interface. They propose : to identify and remove unsynchronized behavior. to extend the refinement to more than two components itemize Main contribution : Local synchronization detection method for component based on parallel composition and an AR methof for modular MC. Circuit class : Asynchronous
BibTeX: @article{5374376, author = {Hao Zheng and Haiqiong Yao and Yoneda, T.}, title = {Modular Model Checking of Large Asynchronous Designs with Efficient Abstraction Refinement}, journal = {Computers, IEEE Transactions on}, year = {2010}, volume = {59}, number = {4}, pages = {561 -573}, doi = {http://dx.doi.org/10.1109/TC.2009.187} }

Created by JabRef on 07/03/2012.