The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Automatic generation of software behavioral models
Abstract
Dynamic analysis of software systems produces behavioral models that are useful for analysis, verification and testing.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Dynamically discovering likely program invariants to support program evolution
Ernst, M. D., Cockrell, J., Griswold, W. G., & Notkin, D. (2001) · IEEE Transactions on Software Engineering · doi:10.1109/32.908957 · Cited by 1,050
Discovering models of software processes from event-based data
Cook, J. E., & Wolf, A. L. (1998) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/287000.287001 · Cited by 870
The category-partition method for specifying and generating functional tests
Ostrand, T. J., & Balcer, M. J. (1988) · Communications of the ACM · doi:10.1145/62959.62964 · Cited by 791
Simplify: a theorem prover for program checking
Detlefs, D., Nelson, G., & Saxe, J. B. (2005) · Journal of the ACM · doi:10.1145/1066100.1066102 · Cited by 786
Ammons, G., Bodík, R., & Larus, J. R. (2002) · Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/503272.503275 · Cited by 665
Tracking down software bugs using automatic anomaly detection
Hangal, S., & Lam, M. S. (2002) · Proceedings/Proceedings - International Conference on Software Engineering · doi:10.1145/581339.581377 · Cited by 602
On the Synthesis of Finite-State Machines from Samples of Their Behavior
Biermann, A. W., & Feldman, J. A. (1972) · IEEE Transactions on Computers · doi:10.1109/tc.1972.5009015 · Cited by 510
Perracotta: mining temporal API rules from imperfect traces
Yang, J., Evans, D., Bhardwaj, D., Bhat, T., & Das, M. (2006) · Proceedings of the 28th international conference on Software engineering · doi:10.1145/1134285.1134325 · Cited by 406
A survey of structured and object-oriented software specification methods and techniques
Wieringa, R. (1998) · ACM Computing Surveys · doi:10.1145/299917.299919 · Cited by 200
Confirming configurations in efsm testing
Petrenko, A., Boroday, S., & Groz, R. (2004) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2004.1265734 · Cited by 166
Improving test suites via operational abstraction
Harder, M. P. F., Mellen, J., & Ernst, M. D. (2003) · doi:10.5555/776816.776824 · Cited by 163
Discovering Algebraic Specifications from Java Classes
Henkel, J., & Ζ, A. D. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45070-2_19 · Cited by 135
Semantic anomaly detection in online data sources
Raz, O., Koopman, P. J., & Shaw, M. (2002) · ACM/IEEE International Conference on Software Engineering: Companion Proceedings (ICSE-Companion) · doi:10.1145/581339.581378 · Cited by 104
Static verification of dynamically detected program invariants
Nimmer, J. W., & Ernst, M. D. (2001) · Electronic Notes in Theoretical Computer Science · doi:10.1016/s1571-0661(04)00256-7 · Cited by 91
Dynamic Detection of COTS Component Incompatibility
Mariani, L., & Pezzè, M. (2007) · IEEE Software · doi:10.1109/ms.2007.138 · Cited by 80
Self-citationDSD-Crasher: a hybrid analysis tool for bug finding
Csallner, C., & Smaragdakis, Y. (2006) · International Symposium on Software Testing and Analysis · doi:10.1145/1146238.1146267 · Cited by 76
Learning Automata from Ordered Examples
Porat, S., & Feldman, J. A. (1991) · Machine Learning · doi:10.1007/bf00114841 · Cited by 61
Regular Inference for State Machines with Parameters
Berg, T., Jönsson, B., & Raffelt, H. (2006) · Lecture notes in computer science · doi:10.1007/11693017_10 · Cited by 59
Cited by
The oracle problem in software testing: A survey
Barr, E. T., Harman, M., McMinn, P., Shahbaz, M., & Yoo, S. (2015) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2014.2372785 · Cited by 1,104
Automatic Software Repair: A Survey
Gazzola, L., Micucci, D., & Mariani, L. (2019) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2017.2755013 · Cited by 327
Self-citationInferring extended finite state machine models from software executions
Walkinshaw, N., Taylor, R., & Derrick, J. (2016) · Empirical Software Engineering · doi:10.1007/s10664-015-9367-7 · Cited by 127
“Notable examples include Dallmeier et al.’s ADABU technique [20] and Lorenzoli et al.’s Gk-tails algorithm [10].”
BackgroundMethodInfluentialAutomatically Generating Test Cases for Specification Mining
Dallmeier, V., Knopp, N., Mallon, C., Fraser, G., Hack, S., & Zeller, A. (2012) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2011.105 · Cited by 67
Metadata
- Authors
- Lorenzoli, D., Mariani, L., & Pezzè, M.
- Venue
- Proceedings of the 13th international conference on Software engineering - ICSE '08
- Publisher
- ACM Press
- Published
- 2008
- Pages
- 501
- ISSN
- 0270-5257 (ISSN-L)
- OpenAlex
- W2124081952
- Cited by
- 416
- References
- 18
- FWCI
- 19.15
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.