Filters








30,204 Hits in 3.7 sec

Adding configuration to the choice calculus

Martin Erwig, Klaus Ostermann, Tillmann Rendel, Eric Walkingshaw
<span title="">2013</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/wa3vuzcwpngijonis3kzgcnjq4" style="color: black;">Proceedings of the Seventh International Workshop on Variability Modelling of Software-intensive Systems - VaMoS &#39;13</a> </i> &nbsp;
In this paper we add a selection operation to the choice calculus and illustrate how that increases the expressiveness of the calculus.  ...  The choice calculus, a formal language for representing variation in software artifacts, features syntactic forms to map dimensions of variability to local choices between source code variants.  ...  We thank the anonymous reviewers for their helpful comments and Sebastian Erdweg, Sven Apel, Christian Kästner and Erik Ernst for discussions about the choice calculus and the need for a select form.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2430502.2430520">doi:10.1145/2430502.2430520</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/vamos/ErwigORW13.html">dblp:conf/vamos/ErwigORW13</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ynkxx4yjunf3ndte7lqjkxx6s4">fatcat:ynkxx4yjunf3ndte7lqjkxx6s4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808191831/http://web.engr.oregonstate.edu/~walkiner/papers/vamos13-cc-select.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/04/2f/042f7a6dc02f2b000ccdc0d6f16077730cf97fad.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2430502.2430520"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Projectional editing of variational software

Eric Walkingshaw, Klaus Ostermann
<span title="2014-09-15">2014</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/xu5bk2lj5rbdxlx6222nw7tsxi" style="color: black;">SIGPLAN notices</a> </i> &nbsp;
When editing some configurations and not others, it would be easier to edit a simplified version of the source code that includes only the configurations we currently care about.  ...  Editing the source code of variational software is complicated by the presence of variation annotations, such as #ifdef statements, and by code that is only included in some configurations.  ...  Acknowledgments Thank you to Christian Kästner for pointers to related work. This work is supported by the European Research Council, grant 203099.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2775053.2658766">doi:10.1145/2775053.2658766</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/oog7psq6gzgobdnhpzuw7fkedm">fatcat:oog7psq6gzgobdnhpzuw7fkedm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809051058/http://web.engr.oregonstate.edu/~walkiner/papers/gpce14-projectional-editing.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/8c/cb/8ccb904dff79fb2280a6c7d0baf49f7acf4424c8.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2775053.2658766"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Projectional editing of variational software

Eric Walkingshaw, Klaus Ostermann
<span title="">2014</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/njckhhsy45acjc6agj5now7wey" style="color: black;">Proceedings of the 2014 International Conference on Generative Programming: Concepts and Experiences - GPCE 2014</a> </i> &nbsp;
When editing some configurations and not others, it would be easier to edit a simplified version of the source code that includes only the configurations we currently care about.  ...  Editing the source code of variational software is complicated by the presence of variation annotations, such as #ifdef statements, and by code that is only included in some configurations.  ...  Acknowledgments Thank you to Christian Kästner for pointers to related work. This work is supported by the European Research Council, grant 203099.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2658761.2658766">doi:10.1145/2658761.2658766</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/gpce/WalkingshawO14.html">dblp:conf/gpce/WalkingshawO14</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/cp5hubzqevarjoafthzmscdxvy">fatcat:cp5hubzqevarjoafthzmscdxvy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809051058/http://web.engr.oregonstate.edu/~walkiner/papers/gpce14-projectional-editing.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/8c/cb/8ccb904dff79fb2280a6c7d0baf49f7acf4424c8.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2658761.2658766"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

A theory of distributed aspects

Nicolas Tabareau
<span title="">2010</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/scibxvvu3nguvnnafnqcwt7lcy" style="color: black;">Proceedings of the Eighth International Conference on Aspect-Oriented Software Development - AOSD &#39;10</a> </i> &nbsp;
We also give a translation of the aspect join calculus into the core join calculus. The translation is proved to be correct by a bisimilarity argument.  ...  The semantics of the aspect join calculus is given by a (chemical) operational semantics and a type system is developed to ensure properties satisfied by aspects during the execution of a process.  ...  Another choice, maybe more natural with respect to the join calculus, would have been to choose one advice non-deterministically.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1739230.1739246">doi:10.1145/1739230.1739246</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/aosd/Tabareau10.html">dblp:conf/aosd/Tabareau10</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xelumhbrrzg33bx2rdq3dr3uui">fatcat:xelumhbrrzg33bx2rdq3dr3uui</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190311210016/https://core.ac.uk/download/pdf/50617406.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/3c/84/3c84cdc4b2c7a921f437ec30d4f98b32276231a7.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1739230.1739246"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Equivalence of Probabilistic $$\mu $$ -Calculus and p-Automata [chapter]

Claudia Cauli, Nir Piterman
<span title="">2017</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
The proofs use the game semantics of µ p -calculus and automata to show that our translations are correct.  ...  The translation in one direction relies on a normal form of the calculus and in the other direction on the usage of vectorial µ p -calculus.  ...  Conclusion The aim of this paper was to investigate the connection between µ p -calculus and p-automata and to assess their equivalence in expressive power.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-60134-2_6">doi:10.1007/978-3-319-60134-2_6</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4wp4flajcnhq7ohyy7ywdq3qxa">fatcat:4wp4flajcnhq7ohyy7ywdq3qxa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180720121028/https://lra.le.ac.uk/bitstream/2381/41097/2/main.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/05/17/051772b4be605e6102e030b41022de79dc0ac0f9.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-60134-2_6"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Formula choice calculus

Spencer Hubbard, Eric Walkingshaw
<span title="">2016</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/6y3m32grtnfktkp2oo6oqjbvta" style="color: black;">Proceedings of the 7th International Workshop on Feature-Oriented Software Development - FOSD 2016</a> </i> &nbsp;
Therefore, in both theoretical applications of the choice calculus, and in tools inspired by the choice calculus, the syntax of choices has often been generalized to depend on an arbitrary propositional  ...  The choice calculus is a simple metalanguage and associated theory that has been successfully applied to several problems of interest to the feature-oriented software development community.  ...  FA8750-16-C-0044 (Raytheon BBN Technologies) under the DARPA BRASS program.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3001867.3001873">doi:10.1145/3001867.3001873</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/oopsla/HubbardW16.html">dblp:conf/oopsla/HubbardW16</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hbfld4c2bvfjtgjk36idlc4kfq">fatcat:hbfld4c2bvfjtgjk36idlc4kfq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190218131228/https://static.aminer.org/pdf/20170130/pdfs/oopsla/ed6gcg20uhswlua8ynzjoelvqpxr5n7v.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d3/ad/d3adef5bd8b29c5233600a57c9d678026c0b3c94.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3001867.3001873"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Loop Calculus and Belief Propagation for q-ary Alphabet: Loop Tower

Vladimir Y. Chernyak, Michael Chertkov
<span title="">2007</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ux5tf45dtrgptnezraiii73msm" style="color: black;">2007 IEEE International Symposium on Information Theory</a> </i> &nbsp;
the free energy the derivatives of the free energy with respect to factor with respect to factor--functions functions Loop calculus (binary alphabet) Belief Propagation (BP) is exact on a tree Belief  ...  a g g g     } { } { j k b a A generalized loop visualizes A generalized loop visualizes a single a single--configuration contribution configuration contribution to the partition function in BP gauge  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/isit.2007.4557245">doi:10.1109/isit.2007.4557245</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/isit/ChernyakC07.html">dblp:conf/isit/ChernyakC07</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mv37cbbetndhvibeecyzordwc4">fatcat:mv37cbbetndhvibeecyzordwc4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20161221053314/http://cnls.lanl.gov/AISP/talks/chernyak.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/56/1b/561b1110985721fa1389c2f138c0bed5ca6b3828.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/isit.2007.4557245"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

A Dynamic Logic for Deductive Verification of Concurrent Programs

Bernhard Beckert, Vladimir Klebanov
<span title="">2007</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/4gnym4oll5fczbcpsn2kvn53em" style="color: black;">Fifth IEEE International Conference on Software Engineering and Formal Methods (SEFM 2007)</a> </i> &nbsp;
The calculus has been implemented within the KeY system, and we demonstrate it by verifying a central method of the StringBuffer class from the Java standard library.  ...  Even though we cannot yet deal with non-atomic loops, employing the technique of symmetry reduction allows us to verify unbounded systems.  ...  It is a rule of the calculus that axioms can be added to the left side of any sequent at any time.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/sefm.2007.1">doi:10.1109/sefm.2007.1</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/sefm/BeckertK07.html">dblp:conf/sefm/BeckertK07</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/gyc5qvvrurbwjopoebau4zieve">fatcat:gyc5qvvrurbwjopoebau4zieve</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20081031235350/http://www.uni-koblenz.de/~beckert/pub/sefm07.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/34/2d/342d6e424ba12a061b9c1fbfa98b57127878e66c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/sefm.2007.1"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

A Formal Approach to Software Product Families [chapter]

Martin Leucker, Daniel Thoma
<span title="">2012</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
To verify that certain products indeed realize certain features, we propose µ-calculus model-checking for multi-valued Kripke-structures.  ...  The model checking result in that case no longer is a simple truth-value, but a set of products, conforming to a certain property.  ...  As adding propositions only intricates the developments to come slightly, we show the more general account in the following. the meaning of free variables in ϕ, is an element of L S and is defined as shown  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-34026-0_11">doi:10.1007/978-3-642-34026-0_11</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jufcfok5g5ccnetxezqw2uj45a">fatcat:jufcfok5g5ccnetxezqw2uj45a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200321103446/https://www.isp.uni-luebeck.de/sites/default/files/publications/10.1007-978-3-642-34026-0_11.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/23/a4/23a41419f3a8568816916268769f746d374dd14b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-34026-0_11"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Layered Patterns in Modelling and Transformation of Service-Based Software Architectures [chapter]

Claus Pahl, Ronan Barrett
<span title="">2006</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Architectural configurations, expressed through architectural patterns, form the core of an underlying specification and transformation calculus.  ...  We explore the role layered patterns can play in modelling and as invariants for transformation techniques.  ...  We use the π-calculus as the basis, which helps us to define a notation for service-based architectural configuration.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11966104_11">doi:10.1007/11966104_11</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jg5s37y7ujfkxlyc625524oiua">fatcat:jg5s37y7ujfkxlyc625524oiua</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809123348/http://doras.dcu.ie/15947/1/Layered_Patterns_in_Modelling_and_Transformation_of_Service-Based_Software_Architectures.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b4/d8/b4d870eff86340bd4c368e27ad8a026366ef38e2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11966104_11"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Equivalence of a bridged link calculus and Kirby's calculus of links on nonsimply connected 3-manifolds

Thomas Kerler
<span title="">1998</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/hp7o5f6pmrg57k2m46s4syavf4" style="color: black;">Topology and its Applications</a> </i> &nbsp;
We recall an extension of Kirby's calculus on nonsimply connected 3-manifolds given by Fenn and Rourke ( 1979). and the surgery calculus of bridged links from Kerler (1994), which involves only local moves  ...  We give a short combinatorial proof that the two calculi are equivalent, and thus describe the same classes of 3-manifolds.  ...  This configuration is mapped by P to the Hopf link 'a0 for an appropriately chosen recombination. As described in Paragraph 1 removing or adding this link is a special case of the Q-move.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0166-8641(97)00168-5">doi:10.1016/s0166-8641(97)00168-5</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7iek5idsbjf67kpwv2qcww66mq">fatcat:7iek5idsbjf67kpwv2qcww66mq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190327082818/https://core.ac.uk/download/pdf/82091563.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7f/e0/7fe08506e41c4934bbee43fae62decc49ea4ebee.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0166-8641(97)00168-5"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Separation Results Via Leader Election Problems [chapter]

Maria Grazia Vigliotti, Iain Phillips, Catuscia Palamidessi
<span title="">2006</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
It is clear that the mixed choice operator is the key for the expressiveness result in the π-calculus.  ...  We consider the π-calculus with mixed choice and with separate choice, value-passing CCS and Mobile Ambients. We provide a unified approach for all these calculi using reduction semantics.  ...  Maria Grazia Vigliotti thanks the Group MIMOSA at INRIA Sophia Antipolis for having allowed her to work as guest at their site. We also thank the anonymous referees for their comments.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11804192_9">doi:10.1007/11804192_9</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/agpocoyf6na5pncnvp65frar2e">fatcat:agpocoyf6na5pncnvp65frar2e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190412225619/https://core.ac.uk/download/pdf/52912471.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a8/e0/a8e0c487627e862b14b4e603c27c58f13e0baf77.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11804192_9"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

From planar graphs to embedded graphs - a new approach to Kauffman and Vogel's polynomial [article]

Rui Pedro Carpentier
<span title="2000-05-12">2000</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Using the graphical calculus of 4 it is shown that the polynomial of a planar graph can be calculated recursively from that of planar graphs with less vertices, which also allows the polynomial of an embedded  ...  The same approach is used to give a direct proof of uniqueness of the (normalized) polynomial restricted to planar graphs.  ...  of this choice).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/math/0005128v1">arXiv:math/0005128v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/lg4i245gyzbbfn2ev4qdvyzxt4">fatcat:lg4i245gyzbbfn2ev4qdvyzxt4</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-math0005128/math0005128.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/math/0005128v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

A confluent calculus for concurrent constraint programming

Kim Marriott, Martin Odersky
<span title="">1997</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/elaf5sq7lfdxfdejhkqbtz6qoq" style="color: black;">Theoretical Computer Science</a> </i> &nbsp;
We show that it is possible to give a natural confluent calculus for concurrent constraint programs, if the syntactic domain is extended by a blind choice operator and a special constant standing for a  ...  Confluence is an important and desirable property as it allows the program to be understood by considering any desired scheduling rule, rather than having to consider all possible schedulings.  ...  Acknowledgements We thank the referees of CP'95 and TCS for their detailed comments.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0304-3975(96)00196-x">doi:10.1016/s0304-3975(96)00196-x</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fvxytybgcjb6fbs37wrtnedt2m">fatcat:fvxytybgcjb6fbs37wrtnedt2m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190324002226/https://core.ac.uk/download/pdf/82232594.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/82/61/826155b11de105e2b99f78a416cd26a7e0e2dc0a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0304-3975(96)00196-x"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Variational Data Structures

Eric Walkingshaw, Christian Kästner, Martin Erwig, Sven Apel, Eric Bodden
<span title="">2014</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/6y3m32grtnfktkp2oo6oqjbvta" style="color: black;">Proceedings of the 2014 ACM International Symposium on New Ideas, New Paradigms, and Reflections on Programming &amp; Software - Onward! &#39;14</a> </i> &nbsp;
So far, variational data structures have been explored and developed ad hoc. This paper is a first attempt and a call to action for systematic and foundational research in this area.  ...  Variation is everywhere, and in the construction and analysis of customizable software it is paramount.  ...  We would also like to thank Paolo G. Giarrusso for helpful comments on an earlier version of this paper.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2661136.2661143">doi:10.1145/2661136.2661143</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/oopsla/WalkingshawKEAB14.html">dblp:conf/oopsla/WalkingshawKEAB14</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/omvqy6xl3jfvrfr477h62my2cm">fatcat:omvqy6xl3jfvrfr477h62my2cm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20160611005852/http://www.bodden.de/pubs/wke+14variational.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f4/50/f4506dc941fe595c4b43e418080af4418a6c5fba.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2661136.2661143"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 30,204 results