The version with absolute timing is generally considered to be less simple than the one with relative timing . Our main reason to consider absolute timing as well is that there are applications of process algebra with timing to which absolute timing is better suited than relative timing . It is likely that there are also applications for which it is convenient to use both absolute timing and relative timing . We define an equivalence relation on recursive specifications in process algebra that is model-independent and does not involve an explicit notion of solution . Then we extend this equivalence to the specification language $ \mu$CRL . These developments have led to performance models being studiedby software engineers with little or no experience of stochasticmodelling . Some earlier work with classical process algebra hasinvestigated the use of visual techniques for model construction , e.g . CCS [ 6 ] ; our objectives are to aid post developmentalunderstanding , although some of the approaches are similar . This environment includes specification based testing of safety properties . The results described in the paper have been used to integrate process-algebraic methods into ( concurrent ) object orientated programming ( C. Colby et al. , 1998 ) . Two process – algebraic approaches have been developed for comparing two bisimulation – equivalent processes with respect to speed : the one of Moller/Tofts equips actions with lower time bounds , while the one by Luttgen/Vogler considers upper time bounds instead . This paper sheds new light on both approaches by testifying to their close relationship . We address the problem of formalizing and analyzing architectural styles in an operational setting by introducing the intermediate abstraction of architectural type . We develop the concept of architectural type in a process algebraic framework because of its modeling adequacy and the availability of means , such as Milner 's weak bisimulation equivalence , which allow us to reason compositionally and efficiently about the well formedness of architectural types . Previous methods of verification tend to keep correctness , timing and performance separate . We present a process algebra based methodology for the integrated modelling and verification of correctness , performance and timing properties of concurrent systems . We have applied the method to the domain of asynchronous hardware and used an asynchronous micropipeline as an illustrative example . Those event constraints shall be derived from specifications of the program . FSP is a kind of process algebra notation that can be used to describe formal specifications of concurrent programs . FSP describes concurrent processes as action sequences , where an action can be mapped to a specification-level event . The Hurried Philosophers Case Study . In this paper , we introduce an actor language following a " process algebra " notation . The idea is to define a formalism based on a standard process algebraic approach which provides basic object-oriented features , such as object identity , asynchronous message passing , implicit message acceptance and dynamic object creation . We define the semantics of these stereotypes by a mapping to a process algebra . Finally , we apply model checkers to this process algebra notation and show that we are able to detect the possibility of deadlocks that can then be related back to the UML models . This permits us to give Condition/Event nets a semantics based on true concurrency , in addition to the interleaving-based semantics . In this way the true concurrency aspects of Condition/Event nets are preserved in the process algebra representation and can be analysed using the verification facilities provided by the Circal System . Systems modelled partly using Condition/Event nets partly using the Circal process algebra can also be analysed within the same verification environment . On the other hand the definition and proof of behavioural equivalences is often easier in the process algebra setting . Also standard techniques of algebraic semantics for universal constructions , refinement and compositionality can take better advantage of the process algebra representation . An important example where the combined theory is more convenient than both alternatives is for defining the concurrent ( noninterleaving ) , abstract semantics of distributed systems . CSP is built upon trace semantics while labeled transition systems and bisimulation are the privileged tools to discuss the Pi-calculus seman- tics . In this paper , we try to bring closer both approaches at the theoretical level by showing that proper trace semantics can be built upon the Pi-calculus . Moreover , by introducing locations , we obtain the same discriminative power for both the trace and bisimulation equivalences , in the particular case of early semantics . This paper introduced the PI-calculus theory to the field of process modeling for the first time , and created an accurate process model for coordinated examination and approve system by means of PI-calculus theory . Finally , verified this process model with the method based on PI-calculus theory . The Web Services Choreography Description Language(WS-CDL ) provides a mode to describe peer-to-peer collaborations of parties by defining , from a global view , their common and complementary observable behavior;where ordered message exchanges result in accomplishing a common business goal . Though the WS-CDL is claimed to be based on pi-calculus , but little solid work have been done to prove the effectiveness of pi-calculus in modeling WS-CDL.This paper proposes a pi-calculus based approach to formalization and verification of the WS-CDL.The presented method will ensure the correctness of WS-CDL before executing it so that the cost induced by the failures of the web services executing will decrease . This approach increases efficiency during deployment and lowers the risk of implementing and activating noncompliant web services . So it can not guarantee the correct interaction and usage of the service in the open environment . The paper first defined the signature view and the behavior view of the service then designed the modeling method that transfer the Web service behavior into pi calculus process expression and proposed the algorithm that makes the service view transfer into pi calculus process automatically . At last with the help of operational and transitional semantics and formal deduction we can check whether two services are behavior compatible when their composition . The use of formal methods has been adopted largely , but their interpretation generates another problem . Thus , this paper presents a user-friendly framework that is enabling intuitive visual modeling of systems using UML activity diagrams , and their verification using pi-calculus formal language , without the obligation to master this formal language . In semantic Web service combination research field , formalization description and service combination accuracy validation is a very important problem , in the problem , it involves lots ofWeb service communication collaboration as well as inference , and Pi calculus due to its strong expressive ability and simplemathematical structure superiorities , is thought to be a kind ofmature process algebra method , the method has mobile description mechanism , therefore its application inWeb services communication and interaction is by far a kind of relative mature and implementable method . The paper analyzes semanticWeb service combination form , accuracy validation and Pi calculus principle ; it puts forwards Pi calculus formalization and validation ÂÂbased semantic Web service automatic composition method , and gets accuracy and reliability superiority degree that applies the method in semantic Web service automatic composition . This is subsequently transformed to a declarative programming language for systempsilas instantiation . The pi-calculus notation is adopted for lower level modeling of the SCM . We propose a model which is useful for the development of flexible software systems and support of virtual enterprises and distributed production . In $ \pi$-calculus , emphasis is put on communications through channels ; on the other hand , in \Name{CHAM } , emphasis is put on more abstract and general interactions between program parts . We finally prove adequacy of the $ \pi$-calculus semantics w.r.t . the \Name{CHA- M } semantics . HELM and the Semantic Math-Web.- Calculational Reasoning Revisited An Isabelle/Isar Experience.- Mechanical Proofs about a Non-repudiation Protocol.- Proving Hybrid Protocols Correct.- Nested General Recursion and Partiality in Type Theory.- A Higher-Order Calculus for Categories.- Certifying the Fast Fourier Transform with Coq.- A Generic Library for Floating-Point Numbers and Its Application to Exact Computing.- Ordinal Arithmetic : A Case Study for Rippling in a Higher Order Domain.- Abstraction and Refinement in Higher Order Logic.- A Framework for the Formalisation of Pi Calculus Type Systems in Isabelle/HOL.- Representing Hierarchical Automata in Interactive Theorem Provers.- Refinement Calculus for Logic Programming in Isabelle/HOL.- Predicate Subtyping with Predicate Sets.- A Structural Embedding of Ocsid in PVS.- A Certified Polynomial-Based Decision Procedure for Propositional Logic.- Finite Set Theory in ACL2.- The HOL/NuPRL Proof Translator.- Formalizing Convex Hull Algorithms.- Experiments with Finite Tree Automata in Coq.- Mizar Light for HOL Light . To make this connection precise , we develop an advised ! -calculus that provides an internal language for 2-categories and show how it can be used as a base for the definition of the weaving mechanism of a realistic functional AOP language , called MinAML SLWV - A theorem prover for logic programming.- A Correct goal-directed proof procedure for a general logic program with integrity constraints.- Declarative semantics of hypothetical logic programming with negation as failure.- Conditional narrowing with constructive negation.- CLP $ $ (\mathcal{A}\mathcal{D})$$ as a deductive database language with updates.- Logic programming with functions over order-sorted feature terms.- A direct semantic characterization of RELFUN.- Embedding finite sets in a logic programming language.- A modal framework for structured logic programs.- Metalogic for state oriented programming.- On the semantics of inheritance in logic programming : Compositionality and full abstraction.- The abstract scheme for concurrent programming.- The ? -calculus as a theory in linear logic : Preliminary results.- Natural deduction proof theory for logic programming.- A typed foundation for directional logic programming.- An architecture for Prolog extensions.- Techniques for implementing contexts in Logic Programming.- Implementing a notion of modules in the logic programming language ? Prolog.- Implementational issues in GCLA : A-sufficiency and the definiens operation . We have created a calculus for reasoning about hardware and firmware at the algorithmic state machine ( ASM ) and instruction-set processor ( ISP ) levels of description . The calculus is a value-passing process algebra that extends the Mealy machine model to include parallel composition . It supports reasoning about the composed behavior of synchronous ASM and ISP components and microcode . The capabilities of the genetic algorithm as a non-calculus based , global search method makes it potentially useful in the conceptual design of rotor systems . Coupling reasonably simple analysis tools to the genetic algorithm was accomplished , and the resulting program was used to generate designs for rotor systems to match requirements similar to those of both an existing helicopter and a proposed helicopter design . Weakly strategy independent : the image of the encoding is a very small fragment of the λ-calculus , that we call the deterministic λ-calculus Λdet . Essentially , it is the CPS ( continuation-passing style ) λ-calculus restricted to weak evaluation ( i.e. , not under abstractions ) . In Λdet every term has at most one redex , and so all weak strategies collapse into a single deterministic evaluation strategy , because there are no choices between redexes to be made . In fact the existing proposals of transformations of concurrent programs are not based on a general Unfold/Fold transformation theory . The aim of this paper is to define such a theory for the concurrent calculus CCS and to prove it correct . This paper presents a formal specification methodology for embedded systems which is founded upon the /spl pi/-calculus process algebra . The domain model underlying this newly developed methodology identifies eight categories of system building blocks each of which describes a particular system facet . We already have point-based and region-based cardinal direction calculi , but for the relations between other combinations of objects we have only a model . We are , therefore , developing heterogeneous cardinal direction calculus , which allows reasoning on cardinal direction relations without regard to object types . In this initial report , we reformulate the definition of cardinal direction relations , identify the sets of relations between various pairs of objects , and develop the methods for deriving upper approximation of converse and composition . The current state of affairs seems to indicate that the two goals are at odds with one another and can not easily be reconciled . This paper presents COCHIS , the Calculus Of CoHerent ImplicitS , an improved variant of the implicit calculus that offers flexibility while preserving two key properties : coherence and stability of type substitutions . COCHIS supports polymorphism , local scoping , overlapping instances , first-class instances and higher-order rules , while remaining type-safe , coherent and stable under type substitution . We investigate the most significant logical features of this calculus and prove that it is both sound and complete with respect to a simple class of enriched Boolean algebras which we call auto-Boolean algebras . Moreover , we show that Leibniz ’s calculus can reproduce all the laws of classical propositional logic , thus allowing Leibniz to achieve his goal of reducing propositional reasoning to algebraic reasoning about terms . Strictly positive logics recently attracted attention both in the description logic and in the provability logic communities for their combination of efficiency and sufficient expressivity . The language of Reflection Calculus RC consists of implications between formulas built up from propositional variables and the constant ‘ true ’ using only conjunction and the diamond modalities which are interpreted in Peano arithmetic as restricted uniform reflection principles . In fact , piracy can be clearly traced using the privacy homomorphism property of RSA and the embedded watermark mechanism . Further , in the proposed protocol , the seller himself can trace the piracy using exponential calculus . Since it is unnecessary to trust third party participation , the conspiracy problem is resolved and the new buyer is not required to participate in the dispute . By applying the recursion ( 2 ) several times , He et al . showed in [ reference ] that the output of the m - th residual unit admits a representation of the form Furthermore , if l is the loss that is used to train the network , we can use the chain rule of calculus and express the derivative of the loss l with respect to the output x n of the n - th RU as Thus , we find This paper presents a comparative survey of formalisms related to mobile agents . It describes the π-calculus and its extensions , the Ambient calculus , Petri nets , Actors , and the family of generative communication languages . Each of these formalisms defines a mathematical framework that can be used to reason about mobile code ; they vary greatly in their expressiveness , in the mechanisms they provide to specify mobile code based applications and in their practical usefulness for the validation and the verification of such applications . We present a new kind of ambient calculus in which the open capability is replaced by direct mobility of generic processes . The calculus comes equipped with a labelled transition system in which types play a major role : this system allows us to show interesting algebraic laws . We introduce labeled syntax trees for ambient processes and use them as possible worlds in a Kripke structure developed for a propositional branching temporal logic . The accessibility relation over labeled syntax trees is generated by the reduction over corresponding Ambient Calculus processes . Providing the algorithms for calculating the accessibility relation between states , we open the perspective of using model checking algorithms developed for temporal logics in analyzing any phenomena described in Ambient Calculus . In this semantics , an equivalence relation , called spatial congruence , is defined on the top of an unlabelled transition system . We show that it is decidable to check whether two ambient calculus processes are spatially congruent or not . This result is based on a natural and intuitive interpretation of ambient processes as edge-labelled unordered trees , which allows us to concentrate on the subtle interaction between two key operators of the ambient calculus , namely restriction , that accounts for the dynamic generation of new location names , and replication , used to encode recursion . Resource control has attracted increasing interest in foundational research on distributed systems . This paper focuses on space control and develops an analysis of space usage in the context of an ambient-like calculus with bounded capacities and weighed processes , where migration and activation require space . A type system complements the dynamics of the calculus by providing static guarantees that the intended capacity bounds are preserved throughout the computation . Abstract We present an ambient-like calculus in which the open capability is dropped , and a new form of “ lightweight ” process mobility is introduced . The calculus comes equipped with a type system that allows the kind of values exchanged in communications and the access and mobility properties of processes to be controlled . We introduce an ambient-based calculus that combines ambient mobility with process mobility , uses group names to collect ambients with homologous features , and exploits co-moves and runtime type checking to implement flexible policies for controlling process activities . Types rely on group names and , to support dynamicity , may depend on group variables . This method supports lightweight and incremental development of AOCA applications . In order to enhance the reliability of the developed applications especially for safety-critical applications , we further propose an Ambient Calculus based formal model to specify AOCA applications . We describe properties for the verification based on Ambient Logic . The notion of mobile ambient first introduced by Cardelli and Gordon was a revolution in implementing information security with the help of ambient calculus in situations where the global availability of the data increases the risk of unauthorised and unwanted access . Information flow is defined in terms of the possibility for a confidential ambient/data to move outside a security boundary , and boundary crossings can be captured through suitable ambient calculus primitives . This concept was further extended to Boxed Ambients and Security Boundaries which added stern measures to the security policy to be full proof . The formal languages used for specification are Predicate Logic and Ambient Calculus . The presented tool is capable of spatial model checking of Ambient Calculus specifications for security policy rules and uses the NuSMV model checker for temporal model checking . We consider TiMo ( Timed Mobility ) which is a process algebra for prototyping software engineering applications supporting mobility and timing constraints . We provide an alternative semantics of TiMo using rewriting logic ; in particular , we develop a rewriting logic model based on strategies to describe a maximal parallel computational step of a TiMo specification . A simple and expressive formalism called TiMo is presented as a simplified version of timed distributed pi-calculus . TiMo aims to bridge the gap between the existing theoretical approach of process calculi and forthcoming realistic languages for multi-agent systems . Interesting properties of such systems refers to process migration , time constraints , bounded liveness and optimal reachability . In this work we describe a tool , called TiMo@PAT , developed by using Process Analysis Toolkit ( PAT ) , an extensible platform for model checkers . We illustrate the capability of TiMo@PAT by analyzing some properties of a distributed system . By using various bisimulations over the behaviours of real-time systems , we can check which behaviours are closer to an optimal and safe behaviour . Automatic analysis is performed using a verification platform called TiMo@PAT which supports the verification of domain-specific properties like process location reachability , time-bounded properties , as well as optimizing resources . Timo Laurmaa . APL usage occurs in many places throughout the world . Hugues Brenot ( 1 ) , Nicolas Theys ( 1 ) , Lieven Clarisse ( 2 ) , Daniel Hurtmans ( 3 ) , Pascal Hedelt ( 3 ) , Margarita Vasquez ( 3 ) , Lucia Mona ( 4 ) , Gelsomina Pappalardo ( 4 ) , Simona Scollo ( 5 ) , Mauro Coltelli ( 5 ) , Tuomas Peltonen ( 6 ) , Juhani Lahtinen ( 6 ) , Marcus Hirtl ( 7 ) , Delia Arnold ( 7 ) , Timo Virtanen ( 8) , Gerrit de Leeuw ( 8) , Guðrún Nína Petersen ( 9 ) , Sara Barsotti ( 9 ) , Matthieu Plu ( 10 ) , Gerhard Wotawa ( 7 ) , and the EUNADICS-AV WP5 team Automatic Creation of a Bi-directional Translation Lexicon from a Parallel Corpus . Timo LAHTINEN : The Use of an Index Term Corpus for the Development of an Automatic Indexer . Ivelin STOIANOV , John NERBONNE and Huub BOUMA : Modelling the Phonotactic Structure of Natural Language Words with Simple Recurrent Networks . Industrial Engineering and Management Thesis supervisor Professor Timo Seppälä Major or Minor/Code SCI3049 Department Operations and Service Management Thesis advisor(s ) Professor D. Sc . Timo Seppälä , M. Sc . Jussi Ahtikari Date 23.10.2017 Number of pages In addition , MLSC achieves significant TPG compared to TIMO . Further , we propose an improvement to TIMO : DC-TIMO ( Diversity Combiner TIMO ) which enables it to perform joint interference nulling and diversity combining . This paper extends the TiMo family by introducing a real-time version named rTiMo . The rTiMo processes are able to move between different locations of a distributed environment , and communicate locally with other processes . Wii ™ Balance Board ™ , the Microsoft ® ( Redmond , WA ) Kinect , the Falcon from Novint Technologies ( Albuquerque , NM ) , or the Tyromotion ( Graz , Austria ) Timo ® plate balance board . IGER is complemented with videogames embedded in a specific taxonomy developed to support rehabilitation progression through time . Josef Nezbeda Maintenance of Configuration Management System , 34 pages , Saimaa University of Applied Sciences , Lappeenranta Faculty of Technology , Information Technology , Double Degree Programme Bachelor ’s Thesis 2011 Instructors : Senior Lecturer Pasi Juvonen , M.Sc.(Eng . ) , Timo Suutari , Tieto Corporation The objective of this thesis is to find way of ideal maintenance of Configuration Management System ( CMS ) to be able to work without unplanned breaks . This setting , although directly applicable only when complete information on the system is available , has several interesting features for reasoning about actions . On one hand , it inherits from the vast literature on process algebras tools for dealing with complex systems , treating suitably important aspects like parallelism , communications , interruptions , coordinations among agents . On the other hand , reasoning by model checking is typically much easier than more general logical services such as validity checking .
The version with absolute timing is generally considered to be less simple than the one with relative timing . Our main reason to consider absolute timing as well is that there are applications of process algebra with timing to which absolute timing is better suited than relative timing . It is likely that there are also applications for which it is convenient to use both absolute timing and relative timing .
We define an equivalence relation on recursive specifications in process algebra that is model-independent and does not involve an explicit notion of solution . Then we extend this equivalence to the specification language $ \mu$CRL .
These developments have led to performance models being studiedby software engineers with little or no experience of stochasticmodelling . Some earlier work with classical process algebra hasinvestigated the use of visual techniques for model construction , e.g . CCS [ 6 ] ; our objectives are to aid post developmentalunderstanding , although some of the approaches are similar .
This environment includes specification based testing of safety properties . The results described in the paper have been used to integrate process-algebraic methods into ( concurrent ) object orientated programming ( C. Colby et al. , 1998 ) .
Two process – algebraic approaches have been developed for comparing two bisimulation – equivalent processes with respect to speed : the one of Moller/Tofts equips actions with lower time bounds , while the one by Luttgen/Vogler considers upper time bounds instead . This paper sheds new light on both approaches by testifying to their close relationship .
We address the problem of formalizing and analyzing architectural styles in an operational setting by introducing the intermediate abstraction of architectural type . We develop the concept of architectural type in a process algebraic framework because of its modeling adequacy and the availability of means , such as Milner 's weak bisimulation equivalence , which allow us to reason compositionally and efficiently about the well formedness of architectural types .
Previous methods of verification tend to keep correctness , timing and performance separate . We present a process algebra based methodology for the integrated modelling and verification of correctness , performance and timing properties of concurrent systems . We have applied the method to the domain of asynchronous hardware and used an asynchronous micropipeline as an illustrative example .
Those event constraints shall be derived from specifications of the program . FSP is a kind of process algebra notation that can be used to describe formal specifications of concurrent programs . FSP describes concurrent processes as action sequences , where an action can be mapped to a specification-level event .
The Hurried Philosophers Case Study . In this paper , we introduce an actor language following a " process algebra " notation . The idea is to define a formalism based on a standard process algebraic approach which provides basic object-oriented features , such as object identity , asynchronous message passing , implicit message acceptance and dynamic object creation .
We define the semantics of these stereotypes by a mapping to a process algebra . Finally , we apply model checkers to this process algebra notation and show that we are able to detect the possibility of deadlocks that can then be related back to the UML models .
This permits us to give Condition/Event nets a semantics based on true concurrency , in addition to the interleaving-based semantics . In this way the true concurrency aspects of Condition/Event nets are preserved in the process algebra representation and can be analysed using the verification facilities provided by the Circal System . Systems modelled partly using Condition/Event nets partly using the Circal process algebra can also be analysed within the same verification environment .
On the other hand the definition and proof of behavioural equivalences is often easier in the process algebra setting . Also standard techniques of algebraic semantics for universal constructions , refinement and compositionality can take better advantage of the process algebra representation . An important example where the combined theory is more convenient than both alternatives is for defining the concurrent ( noninterleaving ) , abstract semantics of distributed systems .
CSP is built upon trace semantics while labeled transition systems and bisimulation are the privileged tools to discuss the Pi-calculus seman- tics . In this paper , we try to bring closer both approaches at the theoretical level by showing that proper trace semantics can be built upon the Pi-calculus . Moreover , by introducing locations , we obtain the same discriminative power for both the trace and bisimulation equivalences , in the particular case of early semantics .
This paper introduced the PI-calculus theory to the field of process modeling for the first time , and created an accurate process model for coordinated examination and approve system by means of PI-calculus theory . Finally , verified this process model with the method based on PI-calculus theory .
The Web Services Choreography Description Language(WS-CDL ) provides a mode to describe peer-to-peer collaborations of parties by defining , from a global view , their common and complementary observable behavior;where ordered message exchanges result in accomplishing a common business goal . Though the WS-CDL is claimed to be based on pi-calculus , but little solid work have been done to prove the effectiveness of pi-calculus in modeling WS-CDL.This paper proposes a pi-calculus based approach to formalization and verification of the WS-CDL.The presented method will ensure the correctness of WS-CDL before executing it so that the cost induced by the failures of the web services executing will decrease . This approach increases efficiency during deployment and lowers the risk of implementing and activating noncompliant web services .
So it can not guarantee the correct interaction and usage of the service in the open environment . The paper first defined the signature view and the behavior view of the service then designed the modeling method that transfer the Web service behavior into pi calculus process expression and proposed the algorithm that makes the service view transfer into pi calculus process automatically . At last with the help of operational and transitional semantics and formal deduction we can check whether two services are behavior compatible when their composition .
The use of formal methods has been adopted largely , but their interpretation generates another problem . Thus , this paper presents a user-friendly framework that is enabling intuitive visual modeling of systems using UML activity diagrams , and their verification using pi-calculus formal language , without the obligation to master this formal language .
In semantic Web service combination research field , formalization description and service combination accuracy validation is a very important problem , in the problem , it involves lots ofWeb service communication collaboration as well as inference , and Pi calculus due to its strong expressive ability and simplemathematical structure superiorities , is thought to be a kind ofmature process algebra method , the method has mobile description mechanism , therefore its application inWeb services communication and interaction is by far a kind of relative mature and implementable method . The paper analyzes semanticWeb service combination form , accuracy validation and Pi calculus principle ; it puts forwards Pi calculus formalization and validation ÂÂbased semantic Web service automatic composition method , and gets accuracy and reliability superiority degree that applies the method in semantic Web service automatic composition .
This is subsequently transformed to a declarative programming language for systempsilas instantiation . The pi-calculus notation is adopted for lower level modeling of the SCM . We propose a model which is useful for the development of flexible software systems and support of virtual enterprises and distributed production .
In $ \pi$-calculus , emphasis is put on communications through channels ; on the other hand , in \Name{CHAM } , emphasis is put on more abstract and general interactions between program parts . We finally prove adequacy of the $ \pi$-calculus semantics w.r.t . the \Name{CHA- M } semantics .
HELM and the Semantic Math-Web.- Calculational Reasoning Revisited An Isabelle/Isar Experience.- Mechanical Proofs about a Non-repudiation Protocol.- Proving Hybrid Protocols Correct.- Nested General Recursion and Partiality in Type Theory.- A Higher-Order Calculus for Categories.- Certifying the Fast Fourier Transform with Coq.- A Generic Library for Floating-Point Numbers and Its Application to Exact Computing.- Ordinal Arithmetic : A Case Study for Rippling in a Higher Order Domain.- Abstraction and Refinement in Higher Order Logic.- A Framework for the Formalisation of Pi Calculus Type Systems in Isabelle/HOL.- Representing Hierarchical Automata in Interactive Theorem Provers.- Refinement Calculus for Logic Programming in Isabelle/HOL.- Predicate Subtyping with Predicate Sets.- A Structural Embedding of Ocsid in PVS.- A Certified Polynomial-Based Decision Procedure for Propositional Logic.- Finite Set Theory in ACL2.- The HOL/NuPRL Proof Translator.- Formalizing Convex Hull Algorithms.- Experiments with Finite Tree Automata in Coq.- Mizar Light for HOL Light .
To make this connection precise , we develop an advised ! -calculus that provides an internal language for 2-categories and show how it can be used as a base for the definition of the weaving mechanism of a realistic functional AOP language , called MinAML
SLWV - A theorem prover for logic programming.- A Correct goal-directed proof procedure for a general logic program with integrity constraints.- Declarative semantics of hypothetical logic programming with negation as failure.- Conditional narrowing with constructive negation.- CLP $ $ (\mathcal{A}\mathcal{D})$$ as a deductive database language with updates.- Logic programming with functions over order-sorted feature terms.- A direct semantic characterization of RELFUN.- Embedding finite sets in a logic programming language.- A modal framework for structured logic programs.- Metalogic for state oriented programming.- On the semantics of inheritance in logic programming : Compositionality and full abstraction.- The abstract scheme for concurrent programming.- The ? -calculus as a theory in linear logic : Preliminary results.- Natural deduction proof theory for logic programming.- A typed foundation for directional logic programming.- An architecture for Prolog extensions.- Techniques for implementing contexts in Logic Programming.- Implementing a notion of modules in the logic programming language ? Prolog.- Implementational issues in GCLA : A-sufficiency and the definiens operation .
We have created a calculus for reasoning about hardware and firmware at the algorithmic state machine ( ASM ) and instruction-set processor ( ISP ) levels of description . The calculus is a value-passing process algebra that extends the Mealy machine model to include parallel composition . It supports reasoning about the composed behavior of synchronous ASM and ISP components and microcode .
The capabilities of the genetic algorithm as a non-calculus based , global search method makes it potentially useful in the conceptual design of rotor systems . Coupling reasonably simple analysis tools to the genetic algorithm was accomplished , and the resulting program was used to generate designs for rotor systems to match requirements similar to those of both an existing helicopter and a proposed helicopter design .
Weakly strategy independent : the image of the encoding is a very small fragment of the λ-calculus , that we call the deterministic λ-calculus Λdet . Essentially , it is the CPS ( continuation-passing style ) λ-calculus restricted to weak evaluation ( i.e. , not under abstractions ) . In Λdet every term has at most one redex , and so all weak strategies collapse into a single deterministic evaluation strategy , because there are no choices between redexes to be made .
In fact the existing proposals of transformations of concurrent programs are not based on a general Unfold/Fold transformation theory . The aim of this paper is to define such a theory for the concurrent calculus CCS and to prove it correct .
This paper presents a formal specification methodology for embedded systems which is founded upon the /spl pi/-calculus process algebra . The domain model underlying this newly developed methodology identifies eight categories of system building blocks each of which describes a particular system facet .
We already have point-based and region-based cardinal direction calculi , but for the relations between other combinations of objects we have only a model . We are , therefore , developing heterogeneous cardinal direction calculus , which allows reasoning on cardinal direction relations without regard to object types . In this initial report , we reformulate the definition of cardinal direction relations , identify the sets of relations between various pairs of objects , and develop the methods for deriving upper approximation of converse and composition .
The current state of affairs seems to indicate that the two goals are at odds with one another and can not easily be reconciled . This paper presents COCHIS , the Calculus Of CoHerent ImplicitS , an improved variant of the implicit calculus that offers flexibility while preserving two key properties : coherence and stability of type substitutions . COCHIS supports polymorphism , local scoping , overlapping instances , first-class instances and higher-order rules , while remaining type-safe , coherent and stable under type substitution .
We investigate the most significant logical features of this calculus and prove that it is both sound and complete with respect to a simple class of enriched Boolean algebras which we call auto-Boolean algebras . Moreover , we show that Leibniz ’s calculus can reproduce all the laws of classical propositional logic , thus allowing Leibniz to achieve his goal of reducing propositional reasoning to algebraic reasoning about terms .
Strictly positive logics recently attracted attention both in the description logic and in the provability logic communities for their combination of efficiency and sufficient expressivity . The language of Reflection Calculus RC consists of implications between formulas built up from propositional variables and the constant ‘ true ’ using only conjunction and the diamond modalities which are interpreted in Peano arithmetic as restricted uniform reflection principles .
In fact , piracy can be clearly traced using the privacy homomorphism property of RSA and the embedded watermark mechanism . Further , in the proposed protocol , the seller himself can trace the piracy using exponential calculus . Since it is unnecessary to trust third party participation , the conspiracy problem is resolved and the new buyer is not required to participate in the dispute .
By applying the recursion ( 2 ) several times , He et al . showed in [ reference ] that the output of the m - th residual unit admits a representation of the form Furthermore , if l is the loss that is used to train the network , we can use the chain rule of calculus and express the derivative of the loss l with respect to the output x n of the n - th RU as Thus , we find
This paper presents a comparative survey of formalisms related to mobile agents . It describes the π-calculus and its extensions , the Ambient calculus , Petri nets , Actors , and the family of generative communication languages . Each of these formalisms defines a mathematical framework that can be used to reason about mobile code ; they vary greatly in their expressiveness , in the mechanisms they provide to specify mobile code based applications and in their practical usefulness for the validation and the verification of such applications .
We present a new kind of ambient calculus in which the open capability is replaced by direct mobility of generic processes . The calculus comes equipped with a labelled transition system in which types play a major role : this system allows us to show interesting algebraic laws .
We introduce labeled syntax trees for ambient processes and use them as possible worlds in a Kripke structure developed for a propositional branching temporal logic . The accessibility relation over labeled syntax trees is generated by the reduction over corresponding Ambient Calculus processes . Providing the algorithms for calculating the accessibility relation between states , we open the perspective of using model checking algorithms developed for temporal logics in analyzing any phenomena described in Ambient Calculus .
In this semantics , an equivalence relation , called spatial congruence , is defined on the top of an unlabelled transition system . We show that it is decidable to check whether two ambient calculus processes are spatially congruent or not . This result is based on a natural and intuitive interpretation of ambient processes as edge-labelled unordered trees , which allows us to concentrate on the subtle interaction between two key operators of the ambient calculus , namely restriction , that accounts for the dynamic generation of new location names , and replication , used to encode recursion .
Resource control has attracted increasing interest in foundational research on distributed systems . This paper focuses on space control and develops an analysis of space usage in the context of an ambient-like calculus with bounded capacities and weighed processes , where migration and activation require space . A type system complements the dynamics of the calculus by providing static guarantees that the intended capacity bounds are preserved throughout the computation .
Abstract We present an ambient-like calculus in which the open capability is dropped , and a new form of “ lightweight ” process mobility is introduced . The calculus comes equipped with a type system that allows the kind of values exchanged in communications and the access and mobility properties of processes to be controlled .
We introduce an ambient-based calculus that combines ambient mobility with process mobility , uses group names to collect ambients with homologous features , and exploits co-moves and runtime type checking to implement flexible policies for controlling process activities . Types rely on group names and , to support dynamicity , may depend on group variables .
This method supports lightweight and incremental development of AOCA applications . In order to enhance the reliability of the developed applications especially for safety-critical applications , we further propose an Ambient Calculus based formal model to specify AOCA applications . We describe properties for the verification based on Ambient Logic .
The notion of mobile ambient first introduced by Cardelli and Gordon was a revolution in implementing information security with the help of ambient calculus in situations where the global availability of the data increases the risk of unauthorised and unwanted access . Information flow is defined in terms of the possibility for a confidential ambient/data to move outside a security boundary , and boundary crossings can be captured through suitable ambient calculus primitives . This concept was further extended to Boxed Ambients and Security Boundaries which added stern measures to the security policy to be full proof .
The formal languages used for specification are Predicate Logic and Ambient Calculus . The presented tool is capable of spatial model checking of Ambient Calculus specifications for security policy rules and uses the NuSMV model checker for temporal model checking .
We consider TiMo ( Timed Mobility ) which is a process algebra for prototyping software engineering applications supporting mobility and timing constraints . We provide an alternative semantics of TiMo using rewriting logic ; in particular , we develop a rewriting logic model based on strategies to describe a maximal parallel computational step of a TiMo specification .
A simple and expressive formalism called TiMo is presented as a simplified version of timed distributed pi-calculus . TiMo aims to bridge the gap between the existing theoretical approach of process calculi and forthcoming realistic languages for multi-agent systems .
Interesting properties of such systems refers to process migration , time constraints , bounded liveness and optimal reachability . In this work we describe a tool , called TiMo@PAT , developed by using Process Analysis Toolkit ( PAT ) , an extensible platform for model checkers . We illustrate the capability of TiMo@PAT by analyzing some properties of a distributed system .
By using various bisimulations over the behaviours of real-time systems , we can check which behaviours are closer to an optimal and safe behaviour . Automatic analysis is performed using a verification platform called TiMo@PAT which supports the verification of domain-specific properties like process location reachability , time-bounded properties , as well as optimizing resources .
Timo Laurmaa . APL usage occurs in many places throughout the world .
Hugues Brenot ( 1 ) , Nicolas Theys ( 1 ) , Lieven Clarisse ( 2 ) , Daniel Hurtmans ( 3 ) , Pascal Hedelt ( 3 ) , Margarita Vasquez ( 3 ) , Lucia Mona ( 4 ) , Gelsomina Pappalardo ( 4 ) , Simona Scollo ( 5 ) , Mauro Coltelli ( 5 ) , Tuomas Peltonen ( 6 ) , Juhani Lahtinen ( 6 ) , Marcus Hirtl ( 7 ) , Delia Arnold ( 7 ) , Timo Virtanen ( 8) , Gerrit de Leeuw ( 8) , Guðrún Nína Petersen ( 9 ) , Sara Barsotti ( 9 ) , Matthieu Plu ( 10 ) , Gerhard Wotawa ( 7 ) , and the EUNADICS-AV WP5 team
Automatic Creation of a Bi-directional Translation Lexicon from a Parallel Corpus . Timo LAHTINEN : The Use of an Index Term Corpus for the Development of an Automatic Indexer . Ivelin STOIANOV , John NERBONNE and Huub BOUMA : Modelling the Phonotactic Structure of Natural Language Words with Simple Recurrent Networks .
Industrial Engineering and Management Thesis supervisor Professor Timo Seppälä Major or Minor/Code SCI3049 Department Operations and Service Management Thesis advisor(s ) Professor D. Sc . Timo Seppälä , M. Sc . Jussi Ahtikari Date 23.10.2017 Number of pages
In addition , MLSC achieves significant TPG compared to TIMO . Further , we propose an improvement to TIMO : DC-TIMO ( Diversity Combiner TIMO ) which enables it to perform joint interference nulling and diversity combining .
This paper extends the TiMo family by introducing a real-time version named rTiMo . The rTiMo processes are able to move between different locations of a distributed environment , and communicate locally with other processes .
Wii ™ Balance Board ™ , the Microsoft ® ( Redmond , WA ) Kinect , the Falcon from Novint Technologies ( Albuquerque , NM ) , or the Tyromotion ( Graz , Austria ) Timo ® plate balance board . IGER is complemented with videogames embedded in a specific taxonomy developed to support rehabilitation progression through time .
Josef Nezbeda Maintenance of Configuration Management System , 34 pages , Saimaa University of Applied Sciences , Lappeenranta Faculty of Technology , Information Technology , Double Degree Programme Bachelor ’s Thesis 2011 Instructors : Senior Lecturer Pasi Juvonen , M.Sc.(Eng . ) , Timo Suutari , Tieto Corporation The objective of this thesis is to find way of ideal maintenance of Configuration Management System ( CMS ) to be able to work without unplanned breaks .
This setting , although directly applicable only when complete information on the system is available , has several interesting features for reasoning about actions . On one hand , it inherits from the vast literature on process algebras tools for dealing with complex systems , treating suitably important aspects like parallelism , communications , interruptions , coordinations among agents . On the other hand , reasoning by model checking is typically much easier than more general logical services such as validity checking .
Discrete Absolute Timing Equivalence of recursive specifications in process algebra Visual representation of stochastic process algebra models Design and implementation of Triveni: a process-algebraic API for threads + events Bisimulation on Speed: A Unified Approach On the formalization of architectural types with process algebras Integrating the verification of timing, performance and correctness properties of concurrent systems Event Constraints Definition Based on Finite State Process An Actor Algebra for Specifying Distributed Systems: The Hurried Philosophers Case Study Model checking distributed objects Implementing Condition/Event Nets in the Circal Process Algebra 04241 Abstracts Collection - Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems On Linear Time and Congruence in Channel-passing Calculi Business process modeling and verification of coordinated examination and approve system based on PI-calculus Specification and verification of WS-CDL choreography based on Pi-calculus Research on Web Service Interface Extending and Composition Compatibility Checking Based on pi Calculus A Graph Transformation of Activity Diagrams into π-calculus for Verification Purpose Pi calculus-based semantic web service combination formalization description and validation research Formal model of agent-based supply chain framework in a virtual enterprise for reliability Two Semantics for a Language of Reactive Objects Theorem proving in higher order logics : 14th International Conference, TPHOLs 2001, Edinburgh, Scotland, UK, September 3-6, 2001 : proceedings Aspect oriented programming: a language for 2-categories Extensions of Logic Programming: Third International Workshop, Elp '92, Bologna, Italy, February 26-28, 1992 : Proceedings An Instruction Set Process Calculus The Potential of Genetic Algorithms for Conceptual Design of Rotor Systems Encoding Turing Machines into the Deterministic Lambda-Calculus Unfold/Fold Transformations of Concurrent Processes A new specification methodology for embedded systems based on the /spl pi/-calculus process algebra Toward Heterogeneous Cardinal Direction Calculus COCHIS: Stable and coherent implicits The Logic of Leibniz's Generales Inquisitiones de Analysi Notionum et Veritatum On the Reflection Calculus with Partial Conservativity Operators A Verifiable and Traceable Secondhand Digital Media Market Protocol Full-Resolution Residual Networks for Semantic Segmentation in Street Scenes A survey of theories for mobile agents Types for ambient and process mobility Model Checking Biological Systems Described Using Ambient Calculus Spatial Congruence for Ambients Is Decidable A Calculus of Bounded Capacities Mobility Types for Mobile Processes in Mobile Ambients A Mobility Calculus with Local and Dependent Types Programming Method and Formalization for Activity-Oriented Context-Aware Applications Securing Electronic Health Records Model Checking of Location and Mobility Related Security Policy Specifications in Ambient Calculus A Timed Mobility Semantics Based on Rewriting Strategies TiMo: Timed Mobility in Distributed Systems Automatic Analysis of TiMo Systems in PAT Verification of critical systems described in real-time TiMo  A quote quad interview: Timo Laurmaa Prototype of multi-hazard early warning from EUNADICS-AV systems to trigger model forecasts of European airspace Computational Linguistics in the Netherlands 1997, selected papers from the Eighth CLIN Meeting Strategic Decisions for Becoming a Multi-Sided Platform: A Case Study Robust OFDM Diversity Receiver under Co-channel Narrowband Interference Real-Time Migration Properties of rTiMo Verified in Uppaal Computational Intelligence and Game Design for Effective At-Home Stroke Rehabilitation. Maintenance of Configuration Management System Reasoning about Nondeterministic and Concurrent Actions: A Process Algebra Approach
e90ef020df510bef5f7a79ec8044be87671d66fb c3c1dae75e7cd34f828081b377c4c1436918394d 26f6c8257c0d80f0bc5e438678ec69b8b1fc023d 0a55e8b57c9be2168257ddf1ec77796e3c6949db 7aa43c281e278c1a4fab105f419ca51a785facd3 c4594e70d7c61acdbb8d04b8c00888307a5167e3 c77b7837ae703f09fe9fbeb85a1134ada4089338 93e8d1ec0e3c2b6a84cc05d4bf5cb5a776d0c587 be3c6a0ba68cb04c96c01f1372a5300b2ac1281b 01362fb637924a87e60203fcfa8902769286973d 8f7c32a7c02683fea95dacd27269c7f00a2b01ec 05e61e9d36a519b905e51059707ac5eb1537c180 a5a7555ea15de1520e43c5c29a83db0a3b33a600 f561b88109ccd7f97850a4d2ed9cc5953c08309f 021b5b40b4e6f9dadd59b97752ace18400ac93bb 57e201287f1cfbd3106fe09a3601c98a3cb9c013 3905bc9ebbe10340e8d4fda4fd25507f65c8e2f6 c3be8b797c7092cca3461d5672068e5e1b9915a6 7f45ce09f43da5f85c2fa272d60034790c81f1b8 0b797e8f6ca0dc534f15d2a6a1862ded10543c22 5744e5a3f73b7106f594d7cb5e295c066021dbeb 3c29933e24c8f763e34cc18aeb70e21819e32152 6090ec94b4bac8653a74bbc130475c9c85a30d1e 3d3d0d1ee502d0543adfd9c39d8f12631921a200 9026b5e4dc76cab7bcdab441df05c8e80da071be 0c5b71abbb2ccc86e0c26d2238765ac8854b96ce 5081ccd57865c8eb9dabaf284547dda20bb738ce 51f73b7e78afbf5fbb81bede700b92ce7333f72f 1433fe1e36895eb098d5ebeaa5f53f29951ce46b ca49f46a7ae6e954622335a966ffe94baa75729b d8ced198ce531d400a7f3aa12bc6aea1368524bd 375570ea65fed626c3ddaba3c7939d2e5f5e1951 58d22f1030b121c921b03b63ae61837837dabb6f 6a32146e0637a600ec9dfbbb63b7bd43ac6b5c35 0cc00a39ad4ac80828115614fe7daa1b33683de8 8ad28a7a30fd5e236a8920622cdeb04dc9865f92 8e252b8d7e4da2933a3040d57bd29d0b0486dc9d d5fc5cef958a36a0ed95ab76578ebd42284c59b3 51f9b7b98a75851c0f38aa52b5bec58365698c18 a308a184fcb88eac6943747127ebede551593405 b5fda399b1c96ba562ed56aa04172dba2d5d4dd2 67509fcfd2b1e47b19633a0c398e6b70236de89e 31469257b6c06c2f9e4b29486c4bc2f00c519b76 d389889021f7de90a978014f98bbd97dec21ad65 a91ce6274a9f605d11afc1e434aecbbe79870ce2 bb054b6c862d0bd5ec25f2bea3c318a1017827cf f0c5d480f84382ce2816c106c34a65400efae723 317fa73099834fdc5c66b1b649c99d4823e11c05 4b713c9db0f78bc928b8a5ba46980f7fb67e1ea0 b11742661ce0874708e881fb08a2169a6cde6a90 b7955c85afe7d3a132c6af59d630c6de122a07dd 1c4bfdfaf874eb09e3b7e773b72be238af83713d 585f76b472ff20bd05f0ef05c2bf4a66a9a261e7 385b95c03f1500c85f7fa8e63d91cd00438460dd c765e4f94e250d240e31151513026968dc56bae2 7f524cc3abe71751c54d5aa413285de65e00e0dc
["Computer Science"] ["Mathematics","Computer Science"] ["Computer Science"] ["Computer Science"] ["Mathematics","Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Mathematics","Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Engineering","Computer Science"] ["Computer Science","Mathematics"] ["Computer Science"] ["Computer Science"] ["Mathematics","Computer Science"] ["Computer Science"] ["Mathematics","Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science","Mathematics"] ["Computer Science"] ["Mathematics","Computer Science"] ["Computer Science","Mathematics"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science","Medicine"] ["Computer Science"] ["Computer Science","Mathematics"]
2002 2001 2000 1998 2005 2000 1998 2002 2001 2000 2002 2004 2004 2007 2008 2008 2018 2014 2008 1995 2001 2011 1993 1998 1993 2017 1996 2003 2009 2019 2016 2017 2011 2017 1998 2008 2005 2000 2003 2003 2005 2015 2010 2010 2012 2013 2013 2017 1996 2018 1998 2017 2018 2013 2013 2011 1996
Workshop on Software and Performance ICCL FoSSaCS SIGSOFT FSE ACSD Concurrent Object-Oriented Programming and Petri Nets FASE Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems ICAASE FOAL FMCAD PLILP IEEE International Workshop on Rapid System Prototyping KI WoLLIC 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) ASIAN Processes, Terms and Cycles UIC/ATC/ScalCom MMM-ACNS SEFM SYNASC ICECCS WiMob SEFM AAAI/IAAI, Vol. 1
https://api.semanticscholar.org/e90ef020df510bef5f7a79ec8044be87671d66fb https://api.semanticscholar.org/c3c1dae75e7cd34f828081b377c4c1436918394d https://api.semanticscholar.org/26f6c8257c0d80f0bc5e438678ec69b8b1fc023d https://api.semanticscholar.org/0a55e8b57c9be2168257ddf1ec77796e3c6949db https://api.semanticscholar.org/7aa43c281e278c1a4fab105f419ca51a785facd3 https://api.semanticscholar.org/c4594e70d7c61acdbb8d04b8c00888307a5167e3 https://api.semanticscholar.org/c77b7837ae703f09fe9fbeb85a1134ada4089338 https://api.semanticscholar.org/93e8d1ec0e3c2b6a84cc05d4bf5cb5a776d0c587 https://api.semanticscholar.org/be3c6a0ba68cb04c96c01f1372a5300b2ac1281b https://api.semanticscholar.org/01362fb637924a87e60203fcfa8902769286973d https://api.semanticscholar.org/8f7c32a7c02683fea95dacd27269c7f00a2b01ec https://api.semanticscholar.org/05e61e9d36a519b905e51059707ac5eb1537c180 https://api.semanticscholar.org/a5a7555ea15de1520e43c5c29a83db0a3b33a600 https://api.semanticscholar.org/f561b88109ccd7f97850a4d2ed9cc5953c08309f https://api.semanticscholar.org/021b5b40b4e6f9dadd59b97752ace18400ac93bb https://api.semanticscholar.org/57e201287f1cfbd3106fe09a3601c98a3cb9c013 https://api.semanticscholar.org/3905bc9ebbe10340e8d4fda4fd25507f65c8e2f6 https://api.semanticscholar.org/c3be8b797c7092cca3461d5672068e5e1b9915a6 https://api.semanticscholar.org/7f45ce09f43da5f85c2fa272d60034790c81f1b8 https://api.semanticscholar.org/0b797e8f6ca0dc534f15d2a6a1862ded10543c22 https://api.semanticscholar.org/5744e5a3f73b7106f594d7cb5e295c066021dbeb https://api.semanticscholar.org/3c29933e24c8f763e34cc18aeb70e21819e32152 https://api.semanticscholar.org/6090ec94b4bac8653a74bbc130475c9c85a30d1e https://api.semanticscholar.org/3d3d0d1ee502d0543adfd9c39d8f12631921a200 https://api.semanticscholar.org/9026b5e4dc76cab7bcdab441df05c8e80da071be https://api.semanticscholar.org/0c5b71abbb2ccc86e0c26d2238765ac8854b96ce https://api.semanticscholar.org/5081ccd57865c8eb9dabaf284547dda20bb738ce https://api.semanticscholar.org/51f73b7e78afbf5fbb81bede700b92ce7333f72f https://api.semanticscholar.org/1433fe1e36895eb098d5ebeaa5f53f29951ce46b https://api.semanticscholar.org/ca49f46a7ae6e954622335a966ffe94baa75729b https://api.semanticscholar.org/d8ced198ce531d400a7f3aa12bc6aea1368524bd https://api.semanticscholar.org/375570ea65fed626c3ddaba3c7939d2e5f5e1951 https://api.semanticscholar.org/58d22f1030b121c921b03b63ae61837837dabb6f https://www.semanticscholar.org/paper/1bb5081766d84549b3411cb56e60483c33cca52d https://api.semanticscholar.org/6a32146e0637a600ec9dfbbb63b7bd43ac6b5c35 https://api.semanticscholar.org/0cc00a39ad4ac80828115614fe7daa1b33683de8 https://api.semanticscholar.org/8ad28a7a30fd5e236a8920622cdeb04dc9865f92 https://api.semanticscholar.org/8e252b8d7e4da2933a3040d57bd29d0b0486dc9d https://api.semanticscholar.org/d5fc5cef958a36a0ed95ab76578ebd42284c59b3 https://api.semanticscholar.org/51f9b7b98a75851c0f38aa52b5bec58365698c18 https://api.semanticscholar.org/a308a184fcb88eac6943747127ebede551593405 https://api.semanticscholar.org/b5fda399b1c96ba562ed56aa04172dba2d5d4dd2 https://api.semanticscholar.org/67509fcfd2b1e47b19633a0c398e6b70236de89e https://api.semanticscholar.org/31469257b6c06c2f9e4b29486c4bc2f00c519b76 https://api.semanticscholar.org/d389889021f7de90a978014f98bbd97dec21ad65 https://api.semanticscholar.org/a91ce6274a9f605d11afc1e434aecbbe79870ce2 https://api.semanticscholar.org/bb054b6c862d0bd5ec25f2bea3c318a1017827cf https://api.semanticscholar.org/f0c5d480f84382ce2816c106c34a65400efae723 https://api.semanticscholar.org/317fa73099834fdc5c66b1b649c99d4823e11c05 https://api.semanticscholar.org/4b713c9db0f78bc928b8a5ba46980f7fb67e1ea0 https://api.semanticscholar.org/b11742661ce0874708e881fb08a2169a6cde6a90 https://api.semanticscholar.org/b7955c85afe7d3a132c6af59d630c6de122a07dd https://api.semanticscholar.org/1c4bfdfaf874eb09e3b7e773b72be238af83713d https://api.semanticscholar.org/585f76b472ff20bd05f0ef05c2bf4a66a9a261e7 https://api.semanticscholar.org/385b95c03f1500c85f7fa8e63d91cd00438460dd https://api.semanticscholar.org/c765e4f94e250d240e31151513026968dc56bae2 https://api.semanticscholar.org/7f524cc3abe71751c54d5aa413285de65e00e0dc