國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

The art of modelling computational s...

Alvim, Mario S.

The art of modelling computational systemsa journey from logic and concurrency to security and privacy : Essays dedicated to Catuscia Palamidessi on the occasion of her 60th birthday /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	The art of modelling computational systemsedited by Mario S. Alvim ... [et al.].
其他題名:	a journey from logic and concurrency to security and privacy : Essays dedicated to Catuscia Palamidessi on the occasion of her 60th birthday /
其他作者:	Alvim, Mario S.
出版者:	Cham :Springer International Publishing :2019.
面頁冊數:	xxxiv, 461 p. :ill., digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Programming languages (Electronic computers)
電子資源:	https://doi.org/10.1007/978-3-030-31175-9
ISBN:	9783030311759$q(electronic bk.)

The art of modelling computational systemsa journey from logic and concurrency to security and privacy : Essays dedicated to Catuscia Palamidessi on the occasion of her 60th birthday /
The art of modelling computational systemsa journey from logic and concurrency to security and privacy : Essays dedicated to Catuscia Palamidessi on the occasion of her 60th birthday /[electronic resource] :edited by Mario S. Alvim ... [et al.]. - Cham :Springer International Publishing :2019. - xxxiv, 461 p. :ill., digital ;24 cm. - Lecture notes in computer science,117600302-9743 ;. - Lecture notes in computer science ;4891..

Concurrency -- Variations of the Itai-Rodeh Algorithm for Computing Anonymous Ring Size -- Axiomatizing Team Equivalence for Finite-State Machines -- Asynchronous pi-calculus at work: the call-by-need strategy -- Deadlock Analysis of Wait-Notify Coordination -- Enhancing reaction systems: a process algebraic approach -- Checking the Expressivity of Firewall Languages -- Polymorphic Session Processes as Morphisms -- Guess Who's Coming: Runtime Inclusion of Participants in Choreographies -- A Complete Axiomatizion of Branching Bisimulation for a Simple Process Language with Probabilistic Choice -- Walking Through the Semantics of Exclusive and Event-Based Gateways in BPMN Choreographies -- Stronger Validity Criteria for Encoding Synchrony -- Confluence of the Chinese Monoid -- Logic and Constraint Programming -- A coalgebraic approach to unification semantics of logic programming -- Polyadic Soft Constraints -- Security and Privacy -- Core-concavity, Gain Functions and Axioms for Information Leakage -- Formalisation of Probabilistic Testing Semantics in Coq -- Fully Syntactic Uniform Continuity Formats for Bisimulation Metrics -- Fooling the Parallel Or Tester with Probability 8/27 -- Categorical information flow -- Statistical Epistemic Logic -- Approximate model counting, sparse XOR constraints and minimum distance -- Verification and Control of Turn-Based Probabilistic Real-Time Games -- Refinement Metrics for Quantitative Information Flow -- Models and Puzzles -- Toward a Formal Model for Group Polarization in Social Networks -- Make Puzzles Great Again.

This Festschrift was published in honor of Catuscia Palamidessi on the occasion of her 60th birthday. It features 6 laudations, which are available in the front matter of the volume, and 25 papers by close collaborators and friends. The papers are organized in topical sections named: concurrency; logic and constraint programming; security and privacy; and models and puzzles. These contributions are a tribute to Catuscia Palamidessi's intellectual depth, vision, passion for science, and tenacity in solving technical problems. They also reflect the breadth and impact of her work. Her scientific interests include, in chronological order, principles of programming languages, concurrency theory, security, and privacy.

ISBN: 9783030311759$q(electronic bk.)

Standard No.: 10.1007/978-3-030-31175-9doiSubjects--Topical Terms:

184586
Programming languages (Electronic computers)

LC Class. No.: QA76.7 / .A78 2019

Dewey Class. No.: 005.13

The art of modelling computational systemsa journey from logic and concurrency to security and privacy : Essays dedicated to Catuscia Palamidessi on the occasion of her 60th birthday /
LDR:03589nmm a2200361 a 4500 001 586949
003 DE-He213
005 20200701151045.0
006 m d
007 cr nn 008maaau
008 210326s2019 sz s 0 eng d
020 $a 9783030311759$q(electronic bk.)
020 $a 9783030311742$q(paper)
024 7 $a 10.1007/978-3-030-31175-9 $2 doi
035 $a 978-3-030-31175-9
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.7 $b .A78 2019
072 7 $a UY $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UY $2 thema
072 7 $a UYA $2 thema
082 0 4 $a 005.13 $2 23
090 $a QA76.7 $b .A784 2019
245 0 4 $a The art of modelling computational systems $h [electronic resource] : $b a journey from logic and concurrency to security and privacy : Essays dedicated to Catuscia Palamidessi on the occasion of her 60th birthday / $c edited by Mario S. Alvim ... [et al.].
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a xxxiv, 461 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 11760
490 1 $a Theoretical computer science and general issues
505 0 $a Concurrency -- Variations of the Itai-Rodeh Algorithm for Computing Anonymous Ring Size -- Axiomatizing Team Equivalence for Finite-State Machines -- Asynchronous pi-calculus at work: the call-by-need strategy -- Deadlock Analysis of Wait-Notify Coordination -- Enhancing reaction systems: a process algebraic approach -- Checking the Expressivity of Firewall Languages -- Polymorphic Session Processes as Morphisms -- Guess Who's Coming: Runtime Inclusion of Participants in Choreographies -- A Complete Axiomatizion of Branching Bisimulation for a Simple Process Language with Probabilistic Choice -- Walking Through the Semantics of Exclusive and Event-Based Gateways in BPMN Choreographies -- Stronger Validity Criteria for Encoding Synchrony -- Confluence of the Chinese Monoid -- Logic and Constraint Programming -- A coalgebraic approach to unification semantics of logic programming -- Polyadic Soft Constraints -- Security and Privacy -- Core-concavity, Gain Functions and Axioms for Information Leakage -- Formalisation of Probabilistic Testing Semantics in Coq -- Fully Syntactic Uniform Continuity Formats for Bisimulation Metrics -- Fooling the Parallel Or Tester with Probability 8/27 -- Categorical information flow -- Statistical Epistemic Logic -- Approximate model counting, sparse XOR constraints and minimum distance -- Verification and Control of Turn-Based Probabilistic Real-Time Games -- Refinement Metrics for Quantitative Information Flow -- Models and Puzzles -- Toward a Formal Model for Group Polarization in Social Networks -- Make Puzzles Great Again.
520 $a This Festschrift was published in honor of Catuscia Palamidessi on the occasion of her 60th birthday. It features 6 laudations, which are available in the front matter of the volume, and 25 papers by close collaborators and friends. The papers are organized in topical sections named: concurrency; logic and constraint programming; security and privacy; and models and puzzles. These contributions are a tribute to Catuscia Palamidessi's intellectual depth, vision, passion for science, and tenacity in solving technical problems. They also reflect the breadth and impact of her work. Her scientific interests include, in chronological order, principles of programming languages, concurrency theory, security, and privacy.
650 0 $a Programming languages (Electronic computers) $3 184586
650 0 $a Computer security. $3 184416
650 1 4 $a Theory of Computation. $3 274475
650 2 4 $a Software Engineering/Programming and Operating Systems. $3 273711
650 2 4 $a Logic in AI. $3 836108
650 2 4 $a Probability and Statistics in Computer Science. $3 274053
650 2 4 $a Systems and Data Security. $3 274481
700 1 $a Alvim, Mario S. $3 877166
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
830 0 $a Theoretical computer science and general issues. $3 822018
856 4 0 $u https://doi.org/10.1007/978-3-030-31175-9
950 $a Computer Science (SpringerNature-11645)