Tools and Algorithms for the Construction and Analysis of Systems
- M. Chechik, Jean-François Raskin
- Computer ScienceLecture Notes in Computer Science
- 2016
This paper presents a meta-analyses of parallel SAT simplification on GPU architectures and its applications in reinforcement learning, artificial intelligence, and bioinformatics.
Matching and Merging of Statecharts Specifications
- S. Nejati, M. Sabetzadeh, M. Chechik, S. Easterbrook, P. Zave
- Computer ScienceInternational Conference on Software Engineering
- 24 May 2007
The Match operator is heuristic, making use of both static and behavioural properties of the models to improve the accuracy of matching, and the Merge operator preserves the hierarchical structure of the input models, and handles differences in behaviour through parameterization.
N-way model merging
- J. Rubin, M. Chechik
- Computer ScienceESEC/FSE
- 18 August 2013
This paper defines the n-way merge problem and shows that it can be reduced to the known and widely studied NP-hard problem of weighted set packing.
Partial models: Towards modeling and reasoning with uncertainty
- Michalis Famelis, Rick Salay, M. Chechik
- Computer ScienceInternational Conference on Software Engineering
- 2 June 2012
This paper elaborates an approach to reasoning with partial models containing uncertainty, and concludes that it is able to reap the benefits of well-managed uncertainty while incurring minimal additional cost.
Symbolic optimization with SMT solvers
- Yi Li, Aws Albarghouthi, Zachary Kincaid, A. Gurfinkel, M. Chechik
- Computer ScienceACM-SIGACT Symposium on Principles of Programming…
- 8 January 2014
SYMBA is presented, an efficient SMT-based optimization algorithm for objective functions in the theory of linear real arithmetic (LRA) that can optimize a set of objective functions, reusing information between them to speed up the analysis.
A Survey of Feature Location Techniques
- J. Rubin, M. Chechik
- Computer ScienceDomain Engineering, Product Lines, Languages, and…
- 2013
This chapter discusses possible directions for leveraging SPLE architectures in order to improve the feature location process and describes their implementation strategies and exemplify the techniques on a realistic use-case.
A manifesto for model merging
- Greg Brunet, M. Chechik, S. Easterbrook, S. Nejati, Nan Niu, M. Sabetzadeh
- Computer ScienceGaMMa '06
- 22 May 2006
A framework for comparing different approaches to merging, by treating merge as an algebraic operator over models and model relationships, and emphasizing the need to make explicit all assumptions about the relationships between models, and indeed to treat model relationships as first class objects is proposed.
Combining Related Products into Product Lines
- J. Rubin, M. Chechik
- Computer ScienceFundamental Approaches to Software Engineering
- 24 March 2012
This work focuses on formal specification of a product line refactoring operator called merge-in that puts individual products together into product lines that are deemed similar while explicating those that vary.
Consistency Checking of Conceptual Models via Model Merging
- M. Sabetzadeh, S. Nejati, S. Liaskos, S. Easterbrook, M. Chechik
- Computer ScienceIEEE International Requirements Engineering…
- 19 November 2007
The paper presents a set of reusable expressions for defining consistency constraints in conceptual modelling and demonstrates the use of the developed expressions in the specification of consistency rules for class and ER diagrams, and i* goal models.
A buffer overflow benchmark for software model checkers
- Kelvin Ku, Thomas E. Hart, M. Chechik, D. Lie
- Computer ScienceInternational Conference on Automated Software…
- 5 November 2007
A publicly-available benchmark suite is presented to help guide and evaluate research into software model checking based on abstraction-refinement for buffer overflow detection and a preliminary evaluation of the benchmark is given using the SatAbs model checker.
...
...