A Sorted Semantic Framework for Applied Process Calculi
Applied process calculi include advanced programming constructs such as type systems, communication with pattern matching, encryption primitives, concurrent constraints, nondeterminism, process creation, and dynamic connection topologies. Several such formalisms, e.g. the applied pi calculus, are ex...
Saved in:
| Published in: | Logical methods in computer science Vol. 12, Issue 1; no. 1; p. 1 |
|---|---|
| Main Authors: | , , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Logical Methods in Computer Science e.V
31.03.2016
|
| Subjects: | |
| ISSN: | 1860-5974, 1860-5974 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | Applied process calculi include advanced programming constructs such as type
systems, communication with pattern matching, encryption primitives, concurrent
constraints, nondeterminism, process creation, and dynamic connection
topologies. Several such formalisms, e.g. the applied pi calculus, are
extensions of the the pi-calculus; a growing number is geared towards
particular applications or computational paradigms. Our goal is a unified
framework to represent different process calculi and notions of computation. To
this end, we extend our previous work on psi-calculi with novel abstract
patterns and pattern matching, and add sorts to the data term language, giving
sufficient criteria for subject reduction to hold. Our framework can directly
represent several existing process calculi; the resulting transition systems
are isomorphic to the originals up to strong bisimulation. We also demonstrate
different notions of computation on data terms, including cryptographic
primitives and a lambda-calculus with erratic choice. Finally, we prove
standard congruence and structural properties of bisimulation; the proof has
been machine-checked using Nominal Isabelle in the case of a single name sort. |
|---|---|
| AbstractList | Applied process calculi include advanced programming constructs such as type systems, communication with pattern matching, encryption primitives, concurrent constraints, nondeterminism, process creation, and dynamic connection topologies. Several such formalisms, e.g. the applied pi calculus, are extensions of the the pi-calculus; a growing number is geared towards particular applications or computational paradigms. Our goal is a unified framework to represent different process calculi and notions of computation. To this end, we extend our previous work on psi-calculi with novel abstract patterns and pattern matching, and add sorts to the data term language, giving sufficient criteria for subject reduction to hold. Our framework can directly represent several existing process calculi; the resulting transition systems are isomorphic to the originals up to strong bisimulation. We also demonstrate different notions of computation on data terms, including cryptographic primitives and a lambda-calculus with erratic choice. Finally, we prove standard congruence and structural properties of bisimulation; the proof has been machine-checked using Nominal Isabelle in the case of a single name sort. Applied process calculi include advanced programming constructs such as type systems, communication with pattern matching, encryption primitives, concurrent constraints, nondeterminism, process creation, and dynamic connection topologies. Several such formalisms, e.g. the applied pi calculus, are extensions of the the pi-calculus; a growing number is geared towards particular applications or computational paradigms. Our goal is a unified framework to represent different process calculi and notions of computation. To this end, we extend our previous work on psi-calculi with novel abstract patterns and pattern matching, and add sorts to the data term language, giving sufficient criteria for subject reduction to hold. Our framework can directly represent several existing process calculi; the resulting transition systems are isomorphic to the originals up to strong bisimulation. We also demonstrate different notions of computation on data terms, including cryptographic primitives and a lambda-calculus with erratic choice. Finally, we prove standard congruence and structural properties of bisimulation; the proof has been machine-checked using Nominal Isabelle in the case of a single name sort. Applied process calculi include advanced programming constructs such as type systems, communication with pattern matching, encryption primitives, concurrent constraints, nondeterminism, process creation, and dynamic connection topologies. Several such formalisms, e.g. the applied pi calculus, are extensions of the the pi-calculus; a growing number is geared towards particular applications or computational paradigms. Our goal is a unified framework to represent different process calculi and notions of computation. To this end, we extend our previous work on psi-calculi with novel abstract patterns and pattern matching, and add sorts to the data term language, giving sufficient criteria for subject reduction to hold. Our framework can directly represent several existing process calculi; the resulting transition systems are isomorphic to the originals up to strong bisimulation. We also demonstrate different notions of computation on data terms, including cryptographic primitives and a lambda-calculus with erratic choice. Finally, we prove standard congruence and structural properties of bisimulation; the proof has been machine-checked using Nominal Isabelle in the case of a single name sort. |
| Author | Victor, Björn Parrow, Joachim Gutkovas, Ramūnas Borgström, Johannes Pohjola, Johannes Åman |
| Author_xml | – sequence: 1 givenname: Johannes surname: Borgström fullname: Borgström, Johannes – sequence: 2 givenname: Ramūnas surname: Gutkovas fullname: Gutkovas, Ramūnas – sequence: 3 givenname: Joachim surname: Parrow fullname: Parrow, Joachim – sequence: 4 givenname: Björn surname: Victor fullname: Victor, Björn – sequence: 5 givenname: Johannes Åman orcidid: 0000-0002-6406-7875 surname: Pohjola fullname: Pohjola, Johannes Åman |
| BackLink | https://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-262199$$DView record from Swedish Publication Index (Uppsala universitet) |
| BookMark | eNpVkNFLwzAQxoNMcM69-9hHBau5JE0T38p0OpgoTH0NaZNIZ7eUZGX439ttInovd3z33Y_jO0WDtV9bhM4BXxPg4mb-NFmkQC7gVlwSDPwIDUFwnGYyZ4M_8wkax7jEfVEKgvAhyotk4cPGmmRhV3q9qatkGvTKbn34TJwPSdG2Td2vX4KvbIzJRDdV19Rn6NjpJtrxTx-ht-n96-QxnT8_zCbFPK0og02aVZxj0KQEY5yjNjfUZCW2xBBZCpNJmWlqLGEUW8yIc8xxo0FiI6oMl5yO0OzANV4vVRvqlQ5fyuta7QUfPpQO_deNVRQYzbSV0gnKOANBS8hLY3LLmJPM9KyrAytubduV_2h39Xuxp3WdIpyAlL0dH-xV8DEG634PAKtd7GoXuwKiQAm1i51-A-6-dhM |
| ContentType | Journal Article |
| DBID | AAYXX CITATION ACNBI ADTPV AOWAS D8T DF2 ZZAVC DOA |
| DOI | 10.2168/LMCS-12(1:8)2016 |
| DatabaseName | CrossRef SWEPUB Uppsala universitet full text SwePub SwePub Articles SWEPUB Freely available online SWEPUB Uppsala universitet SwePub Articles full text Directory of Open Access Journals |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | CrossRef |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1860-5974 |
| ExternalDocumentID | oai_doaj_org_article_31435ae99f83464183b17bdd7e44f94d oai_DiVA_org_uu_262199 10_2168_LMCS_12_1_8_2016 |
| GroupedDBID | .4S .DC 29L 2WC 5GY 5VS AAFWJ AAYXX ADBBV ADMLS ADQAK AENEX AFPKN ALMA_UNASSIGNED_HOLDINGS ARCSS BCNDV CITATION EBS EJD FRP GROUPED_DOAJ J9A KQ8 MK~ ML~ M~E OK1 OVT P2P TR2 TUS XSB ACNBI ADTPV AOWAS D8T DF2 ZZAVC |
| ID | FETCH-LOGICAL-c341t-5c6601a2b1ddff3e7d3d5b0e2d29b8d5995a3de2430e042ff4f6da190d8c50b63 |
| IEDL.DBID | DOA |
| ISICitedReferencesCount | 2 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000374769600004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1860-5974 |
| IngestDate | Fri Oct 03 12:35:24 EDT 2025 Tue Nov 04 17:01:12 EST 2025 Sat Nov 29 06:21:51 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Language | English |
| License | https://arxiv.org/licenses/nonexclusive-distrib/1.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c341t-5c6601a2b1ddff3e7d3d5b0e2d29b8d5995a3de2430e042ff4f6da190d8c50b63 |
| ORCID | 0000-0002-6406-7875 |
| OpenAccessLink | https://doaj.org/article/31435ae99f83464183b17bdd7e44f94d |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_31435ae99f83464183b17bdd7e44f94d swepub_primary_oai_DiVA_org_uu_262199 crossref_primary_10_2168_LMCS_12_1_8_2016 |
| PublicationCentury | 2000 |
| PublicationDate | 2016-03-31 |
| PublicationDateYYYYMMDD | 2016-03-31 |
| PublicationDate_xml | – month: 03 year: 2016 text: 2016-03-31 day: 31 |
| PublicationDecade | 2010 |
| PublicationTitle | Logical methods in computer science |
| PublicationYear | 2016 |
| Publisher | Logical Methods in Computer Science e.V |
| Publisher_xml | – name: Logical Methods in Computer Science e.V |
| References | 1079:not-found |
| References_xml | – ident: 1079:not-found |
| SSID | ssj0000331826 |
| Score | 2.013015 |
| Snippet | Applied process calculi include advanced programming constructs such as type
systems, communication with pattern matching, encryption primitives, concurrent... Applied process calculi include advanced programming constructs such as type systems, communication with pattern matching, encryption primitives, concurrent... |
| SourceID | doaj swepub crossref |
| SourceType | Open Website Open Access Repository Index Database |
| StartPage | 1 |
| SubjectTerms | Computer Science computer science - logic in computer science Datavetenskap Expressiveness Nominal sets Pattern matching pi-calculus Theorem proving Type systems |
| Title | A Sorted Semantic Framework for Applied Process Calculi |
| URI | https://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-262199 https://doaj.org/article/31435ae99f83464183b17bdd7e44f94d |
| Volume | 12, Issue 1 |
| WOSCitedRecordID | wos000374769600004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 1860-5974 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000331826 issn: 1860-5974 databaseCode: DOA dateStart: 20040101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 1860-5974 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000331826 issn: 1860-5974 databaseCode: M~E dateStart: 20040101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LS8NAEF6kePDiW6wv9qBgD6HdR5KNt1pbPLRFqJbeln1CoVapjUd_u7NJKq0XL15yCGGyfLM78w07D4SuPUm8j1kaxVzziCdcR8rQLEotSwNlj31xYzrup8OhmEyyp7VRXyEnrGwPXALXZMGhK5dlXjAQBTtQk1RbmzrOfcZtsL7AetaCqcIGMxaIc3kvSUkimv1BZxQRekvuRAOcXrLhh4p2_b-ahRYOprePditmiNvlig7Qlpsfor3V1AVcHcIjlLbxKGTIWjxyr4DL1ODeKsMKAwXFFbHEVQ0A7qiZyWfTY_TS6z53HqNq_EFkwLUso9gkEC0pqom13jMH8NlYtxy1NNPChk5hillHOWs5gNV77hOrwMFbYeKWTtgJqs3f5u4UYdvyhhgIFbUKte-h9M4pkgplIAJWgtdRYwWGfC-7XEiIDgJwMgAnCZVEChmAq6P7gNbPd6E_dfECtCYrrcm_tFZHNyXWG2IepuN2ISbPJU3AlmZn__Gzc7QTFl5WEl6g2nKRu0u0bT6X04_FVbFx4Dn46n4DN67G-w |
| linkProvider | Directory of Open Access Journals |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Sorted+Semantic+Framework+for+Applied+Process+Calculi&rft.jtitle=Logical+methods+in+computer+science&rft.au=Johannes+Borgstr%C3%B6m&rft.au=Ram%C5%ABnas+Gutkovas&rft.au=Joachim+Parrow&rft.au=Bj%C3%B6rn+Victor&rft.date=2016-03-31&rft.pub=Logical+Methods+in+Computer+Science+e.V&rft.eissn=1860-5974&rft.volume=12%2C+Issue+1&rft_id=info:doi/10.2168%2FLMCS-12%281%3A8%292016&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_31435ae99f83464183b17bdd7e44f94d |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1860-5974&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1860-5974&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1860-5974&client=summon |