2016 - ACM Distinguished Member
Corina S. Pasareanu focuses on Software, Model checking, Programming language, Symbolic execution and Java. Her work deals with themes such as Temporal logic and Concurrency, which intersect with Software. Corina S. Pasareanu interconnects Software verification and validation, Software system and Implementation in the investigation of issues within Model checking.
The Symbolic execution study which covers Program analysis that intersects with Machine code, Application domain and Invariant. Her research in Java intersects with topics in Software engineering and Source code. Her research integrates issues of Finite-state machine, Correctness and Executable in her study of Source code.
Corina S. Pasareanu mostly deals with Symbolic execution, Programming language, Theoretical computer science, Model checking and Software. Her work deals with themes such as Program analysis, Probabilistic logic, Artificial intelligence and Algorithm, which intersect with Symbolic execution. Her Systems analysis research extends to the thematically linked field of Programming language.
Her work carried out in the field of Model checking brings together such families of science as Software system, Automated theorem proving and Implementation. Her work in Software system tackles topics such as Source code which are related to areas like Computer engineering. She has included themes like Domain, Software engineering and Test case in her Software study.
Her primary areas of study are Artificial neural network, Artificial intelligence, Symbolic execution, Robustness and Theoretical computer science. Her Artificial neural network research is multidisciplinary, incorporating perspectives in Control, Scalability and Partition. When carried out as part of a general Artificial intelligence research project, her work on Parsing and Probabilistic logic is frequently linked to work in Context, therefore connecting diverse disciplines of study.
Her Symbolic execution research is multidisciplinary, incorporating elements of Security analysis, Program analysis and Software engineering, Load testing. Her work on Regular language as part of general Theoretical computer science study is frequently linked to Feed forward, Vulnerability assessment, Equivalence and Asynchronous communication, bridging the gap between disciplines. She combines Programming language and Badger in her research.
Her primary areas of investigation include Artificial neural network, MNIST database, Artificial intelligence, Robustness and Theoretical computer science. Her Artificial neural network study incorporates themes from Boolean satisfiability problem, Scalability, Parallelizable manifold and Parallel computing. The various areas that Corina S. Pasareanu examines in her MNIST database study include Program analysis, Symbolic execution, Identification, Contextual image classification and Symbolic data analysis.
In her study, she carries out multidisciplinary Program analysis and Context research. Her studies in Artificial intelligence integrate themes in fields like Machine learning and Set. She combines Theoretical computer science and Execution time in her studies.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Bandera: extracting finite-state models from Java source code
James C. Corbett;Matthew B. Dwyer;John Hatcliff;Shawn Laubach.
international conference on software engineering (2000)
Bandera: extracting finite-state models from Java source code
James C. Corbett;Matthew B. Dwyer;John Hatcliff;Shawn Laubach.
international conference on software engineering (2000)
Generalized symbolic execution for model checking and testing
Sarfraz Khurshid;Corina S. Păsăreanu;Willem Visser.
tools and algorithms for construction and analysis of systems (2003)
Generalized symbolic execution for model checking and testing
Sarfraz Khurshid;Corina S. Păsăreanu;Willem Visser.
tools and algorithms for construction and analysis of systems (2003)
Learning assumptions for compositional verification
Jamieson M. Cobleigh;Dimitra Giannakopoulou;Corina S. Păsăreanu.
tools and algorithms for construction and analysis of systems (2003)
Learning assumptions for compositional verification
Jamieson M. Cobleigh;Dimitra Giannakopoulou;Corina S. Păsăreanu.
tools and algorithms for construction and analysis of systems (2003)
Symbolic execution for software testing in practice: preliminary assessment
Cristian Cadar;Patrice Godefroid;Sarfraz Khurshid;Corina S. Pasareanu.
international conference on software engineering (2011)
Symbolic execution for software testing in practice: preliminary assessment
Cristian Cadar;Patrice Godefroid;Sarfraz Khurshid;Corina S. Pasareanu.
international conference on software engineering (2011)
JPF-SE: a symbolic execution extension to Java PathFinder
Saswat Anand;Corina S. Păsăreanu;Willem Visser.
tools and algorithms for construction and analysis of systems (2007)
JPF-SE: a symbolic execution extension to Java PathFinder
Saswat Anand;Corina S. Păsăreanu;Willem Visser.
tools and algorithms for construction and analysis of systems (2007)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
Amazon (United States)
The University of Texas at Austin
University of Virginia
Stanford University
Vanderbilt University
University of California, Berkeley
Carnegie Mellon University
Jet Propulsion Lab
University of California, Santa Barbara
Kansas State University
Pennsylvania State University
Halmstad University
University of Seville
National Taiwan University
University of Michigan–Ann Arbor
University of New Caledonia
Centre national de la recherche scientifique, CNRS
University of East Anglia
Nagoya University
University of Washington
University of Denver
University of Hong Kong
Max Planck Society
University of Amsterdam
Shriners Hospitals for Children - Erie
University of California, Davis