default search action
E. Pascal Gribomont
Person information
- affiliation: Université de Liège, Belgium
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2006
- [r1]Paul Gochet, E. Pascal Gribomont:
Epistemic logic. Logic and the Modalities in the Twentieth Century 2006: 99-195 - 2005
- [p1]Paul Gochet, E. Pascal Gribomont, Didier Rossetto:
Algorithms for Relevant Logic. Logic, Thought and Action 2005: 479-496 - 2004
- [c18]Pascal Fontaine, E. Pascal Gribomont:
Combining Non-stably Infinite, Non-first Order Theories. D/PDPAR@IJCAR 2004: 37-51 - 2003
- [c17]Pascal Fontaine, E. Pascal Gribomont:
Decidability of Invariant Validation for Paramaterized Systems. TACAS 2003: 97-112 - 2002
- [c16]Pascal Fontaine, E. Pascal Gribomont:
Using BDDs with Combinations of Theories. LPAR 2002: 190-201 - 2000
- [j3]E. Pascal Gribomont:
Simplification of boolean verification conditions. Theor. Comput. Sci. 239(1): 165-185 (2000)
1990 – 1999
- 1999
- [c15]E. Pascal Gribomont, Nachaat Salloum:
System Description: Using OBDD's for the validation of Skolem verification conditions. CADE 1999: 222-226 - 1998
- [c14]E. Pascal Gribomont, Guy Zenner:
Automated Verification of Szymanski's Algorithm. TACAS 1998: 424-438 - 1996
- [c13]E. Pascal Gribomont:
Preprocessing for Invariant Validation. AMAST 1996: 256-270 - [c12]E. Pascal Gribomont:
Atomicity Refinement and Trace Reduction Theorems. CAV 1996: 311-322 - 1995
- [c11]E. Pascal Gribomont, Didier Rossetto:
CAVEAT: Technique and Tool for Computer Aided VErification And Transformation. CAV 1995: 70-83 - 1994
- [c10]E. Pascal Gribomont, Jacques Hagelstein:
Reactive Variables for System Specification and Design. STACS 1994: 275-286 - 1993
- [j2]E. Pascal Gribomont:
Concurrency Without Toil: A Systematics Method for Parallel Program Design. Sci. Comput. Program. 21(1): 1-56 (1993) - [c9]E. Pascal Gribomont, Vincent Van Dongen:
Generic Systolic Arrays: A Methodology for Systolic Design. TAPSOFT 1993: 746-761 - 1990
- [j1]E. Pascal Gribomont:
Stepwise Refinement and Concurrency: The Finite-State Case. Sci. Comput. Program. 14(2-3): 185-228 (1990) - [c8]E. Pascal Gribomont:
A Programming Logic for Formal Concurent Systems. CONCUR 1990: 298-313 - [c7]E. Pascal Gribomont:
Development of Concurrent Systems by Incremental Transformations. ESOP 1990: 161-176
1980 – 1989
- 1989
- [c6]E. Pascal Gribomont:
Stepwise Refinement and Concurrency: A Small Exercise. MPC 1989: 219-238 - [c5]E. Pascal Gribomont:
Development of Concurrent Programs: An Example. TAPSOFT, Vol.2 1989: 210-224 - 1988
- [c4]E. Pascal Gribomont:
Proving Systolic Arrays. CAAP 1988: 185-199 - [c3]E. Pascal Gribomont:
From Synchronous to Asynchronous Communication. Specification and Verification of Concurrent Systems 1988: 368-383 - 1987
- [c2]E. Pascal Gribomont:
Design and Proof of Communicating Sequential Processes. PARLE (2) 1987: 261-276 - 1985
- [c1]E. Pascal Gribomont:
Synthesis of Parallel Programs Invariants. TAPSOFT, Vol.2 1985: 325-338
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:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint