uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
On Bounded Reachability Analysis of Shared Memory Systems
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
LIAFA, CNRS and University of Paris Diderot. (Modeling and Verification)
Chennai Mathematical Institute, Chennai, India.
Chennai Mathematical Institute, Chennai.
2014 (English)In: {IARCS} Annual Conference on Foundations of Software Technology and Theoretical Computer Science, {FSTTCS} 2014, December 15-17, 2014, New Delhi, India, 2014Conference paper, Published paper (Refereed)
Place, publisher, year, edition, pages
2014.
Keyword [en]
concurrent recursive programs, pushdown automata
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:uu:diva-238137OAI: oai:DiVA.org:uu-238137DiVA: diva2:770103
Conference
FSTTCS'14
Projects
UPMARCConcurrent recursive programs
Available from: 2014-12-09 Created: 2014-12-09 Last updated: 2014-12-17

Open Access in DiVA

No full text

Authority records BETA

Atig, Mohamed Faouzi

Search in DiVA

By author/editor
Atig, Mohamed Faouzi
By organisation
Computer Systems
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 416 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf