![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Jamieson M. Cobleigh
Person information
- affiliation: University of Massachusetts Amherst, USA
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
- [j6]Corina S. Pasareanu, Dimitra Giannakopoulou, Mihaela Gheorghiu Bobaru, Jamieson M. Cobleigh, Howard Barringer:
Learning to divide and conquer: applying the L* algorithm to automate assume-guarantee reasoning. Formal Methods Syst. Des. 32(3): 175-205 (2008) - [j5]Jamieson M. Cobleigh, George S. Avrunin, Lori A. Clarke:
Breaking up is hard to do: An evaluation of automated assume-guarantee reasoning. ACM Trans. Softw. Eng. Methodol. 17(2): 7:1-7:52 (2008) - 2006
- [c7]Jamieson M. Cobleigh, George S. Avrunin, Lori A. Clarke:
Breaking up is hard to do: an investigation of decomposition for assume-guarantee reasoning. ISSTA 2006: 97-108 - 2004
- [j4]Matthew B. Dwyer
, Lori A. Clarke, Jamieson M. Cobleigh, Gleb Naumovich:
Flow analysis for verifying properties of concurrent software systems. ACM Trans. Softw. Eng. Methodol. 13(4): 359-430 (2004) - [c6]Dimitra Giannakopoulou, Corina S. Pasareanu, Jamieson M. Cobleigh:
Assume-Guarantee Verification of Source Code with Design-Level Assumptions. ICSE 2004: 211-220 - 2003
- [c5]Jamieson M. Cobleigh, Dimitra Giannakopoulou, Corina S. Pasareanu:
Learning Assumptions for Compositional Verification. TACAS 2003: 331-346 - 2002
- [j3]Jamieson M. Cobleigh, Lori A. Clarke, Leon J. Osterweil:
FLAVERS: A finite state verification technique for software systems. IBM Syst. J. 41(1): 140-165 (2002) - [c4]Jamieson M. Cobleigh, Leon J. Osterweil, Alexander E. Wise, Barbara Staudt Lerner:
Containment units: a hierarchically composable architecture for adaptive systems. SIGSOFT FSE 2002: 159-165 - 2001
- [j2]S. K. Smith, Jamieson M. Cobleigh, V. Svetnik:
Evaluation of a 1H-13C NMR Spectral Library. J. Chem. Inf. Comput. Sci. 41(6): 1463-1469 (2001) - [c3]Jamieson M. Cobleigh, Lori A. Clarke, Leon J. Osterweil:
The Right Algorithm at the Right Time: Comparing Data Flow Analysis Algorithms for Finite State Verification. ICSE 2001: 37-46 - 2000
- [c2]Jamieson M. Cobleigh, Lori A. Clarke, Leon J. Osterweil:
Verifying properties of process definitions. ISSTA 2000: 96-101
1990 – 1999
- 1999
- [j1]Gleb Naumovich, Lori A. Clarke, Jamieson M. Cobleigh:
Using partial order techniques to improve performance of data flow analysis based verification. ACM SIGSOFT Softw. Eng. Notes 24(5): 57-65 (1999) - [c1]Gleb Naumovich, Lori A. Clarke, Jamieson M. Cobleigh:
Using Partial Order Techniques to Improve Performance of Data Flow Analysis Based Verification. PASTE 1999: 57-65
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint