Safe Generation in Feature-Oriented Software Development Sven Apel
|
|
|
- Sylvia Mosley
- 8 years ago
- Views:
Transcription
1 Safe Generation in Feature-Oriented Software Development Sven Apel Lehrstuhl für Programmierung Universität Passau
2 Software Product Line Engineering OS FAME-DBMS BufferMgr Statistics Storage Domain Analysis Nut/OS Win Persistent InMemory API B-Tree Heap Alloc Paging Get Put Del Static Dynamic LRU LFU optional mandatory AND XOR OR Slide - 2
3 Software Product Line Engineering OS FAME-DBMS BufferMgr Statistics Storage Domain Analysis Nut/OS Win Persistent InMemory API B-Tree Heap Alloc Paging Get Put Del Static Dynamic LRU LFU optional mandatory AND XOR OR... OS Nut/OS Win API Get Put Del... Slide - 3
4 Feature-Oriented Software Development OS FAME-DBMS BufferMgr Statistics Storage Domain Analysis Nut/OS Win Persistent InMemory API B-Tree Heap Alloc Paging Get Put Del Static Dynamic LRU LFU... Design & Implementation Slide - 4
5 Compositional Approach = = = = Slide - 5
6 Safe Generation Is a generated product correct? Are all products of a product line correct? =??? Slide - 6
7 What Do We Mean by Correctness? Syntactic correctness Type correctness Behavioral correctness Slide - 7
8 Type Correctness Do all valid feature selections produce products without type errors? Basic Graph class Edge { Weight refines class Edge { Weight weight = new Weight(); Dijkstra class Dijkstra { Path run(graph g) { e.weight; Slide - 8
9 Type Correctness Do all valid feature selections produce products without type errors? Basic Graph class Edge { Weight refines class Edge { Weight weight = new Weight(); Dijkstra class Dijkstra { Path run(graph g) { e.weight; Slide - 9
10 Type Correctness Do all valid feature selections produce products without type errors? Basic Graph class Edge { Dijkstra class Dijkstra { Path run(graph g) { e.weight; Slide - 10
11 How Can We Check Type Correctness? Generate all valid programs and use an ordinary type system, e.g., the Java compiler for AHEAD Not feasible for a growing number of features Check the product line s code base and use information on valid feature combinations product line type system Slide - 11
12 Product Line Type System Software Product Line Generation Generation Variant A Variant B Generation Check Variant C Slide - 12
13 Product Line Type System Software Product Line Generation Generation Variant A Correct Variant B Generation Check Variant C Slide - 13
14 Product Line Type System Software Product Line Generation Generation Variant A Correct Variant B Correct Generation Check Variant C Slide - 14
15 Product Line Type System Software Product Line Generation Generation Variant A Correct Variant B Correct Generation Check Variant C Correct Slide - 15
16 Product Line Type System Details Enrich type rules with presence checks Method invocation Field access Object instantiation Class well-formedness Method well-formedness Subtyping Pattern for additional type checks: Referenced element or type must be present in every valid variant in which also the feature of the referencing element or type is present. Slide - 16
17 Product Line Type System Details Enrich type rules with presence checks Method bar must be present in every valid variant in which also method foo is present. solving a simple SAT problem. Feature A foo() Feature B bar() Feature C bar() Feature Model A B C Slide - 17
18 Product Line Type System Formally Feature Featherweight Java [Apel et al., GPCE'08], [Apel et al., J. ASE'10] Slide - 18
19 Product Line Type System Formally Feature Featherweight Java [Apel et al., GPCE'08], [Apel et al., J. ASE'10] Proved theorems of product line type system Soundness: all programs of a well-typed product line are well-typed Completeness: for a set of well-typed programs there is a well-typed product line Prototype implementation in Haskell Slide - 19
![ASE'10] Proved theorems of product line type system Soundness: all programs of a](/docs-images/43/9069437/images/page_19.jpg "well-typed product line are well-typed Completeness: for a set of well-typed programs")
20 What Do We Mean by Correctness? Syntactic correctness Type correctness Behavioral correctness Slide - 20
21 Behavioral Correctness CorrectSum int sum(int a, int b) { return a + b; WrongSum int sum(int a, int b) { return a - b; Feature Model UseSum CorrectSum WrongSum UseSum int c = sum(a, b); Slide - 21
22 Potential Causes of Behavioral Errors Semantic dependence Feature interaction Slide - 22
23 Semantic Dependence A feature depends on the presence of another feature without referring to that feature there may be no syntactic relationship Tree BinaryTree Algorithm SearchTree BinarySearch Semantic Dependence Slide - 23
24 Feature Interaction Two features may work correct in isolation but exhibit erroneous behavior in combination there may be no syntactic relationships Phone CallWaiting CallForwarding Feature Interaction Slide - 24
25 What is the Problem? Undocumented dependences and interactions Type system reports no errors Compiler produces a runnable program Errors may arise only after a long operation time Slide - 25
26 Method of Resolution Feature-oriented specification and design Feature-oriented verification Domain Analysis Domain Design & Specification Implementation Product Derivation Slide - 26
27 Feature-Oriented Design with FeatureAlloy Based on Alloy [Jackson, TOSEM 2002] Textual, general purpose modeling language module Graph one sig Graph { nodes : set Node { Node in nodes sig Node { inedges : set Edge, outedges : set Edge, edges = inedges + outedges sig Edge { src : one Node, dest : one Node fact prevnext { all n: Node, e: Edge (n in e.src <=> e in n.outedges) && (n in e.dest <=> e in n.inedges) Slide - 27
28 Feature-Oriented Design with FeatureAlloy Based on Alloy [Jackson, TOSEM 2002] Textual, general purpose modeling language Automatic reasoning facilities Alloy Analyzer module Graph one sig Graph { sig Node { sig Edge { fact prevnext { pred nodoubleedges { all e, e : Edge e!= e => e.(src + dest)!= e.(src + dest) run nodoubleedges for 5 assert hasnodoubleedges {!nodoubleedges check hasnodoubleedges for 5 Slide - 28
29 Feature-Oriented Design with FeatureAlloy Based on Alloy [Jackson, TOSEM 2002] Textual, general purpose modeling language Automatic reasoning facilities Alloy Analyzer Visualization facilities Alloy Analyzer Slide - 29
30 Model Features in Separate Units Graph Example Graph module Graph one sig Graph { sig Node { sig Edge { fact prevnext { Tree refines module Graph pred isconnected { some n: Node (Graph.nodes = n) (Graph.nodes = n.^(edges.(src + dest))) pred nocycles { all n: Node n not in (n.^(outedges.dest) + n.^(inedges.src)) pred loneparent { all n: Node lone n.inedges fact istree { nodoubleedges && isconnected && nocycles && loneparent Slide - 30
31 Feature Composition Graph module Graph one sig Graph { sig Node { sig Edge { fact prevnext { Tree refines module Graph pred isconnected { pred nocycles { pred loneparent { fact istree { Slide - 31
32 Feature Composition Graph module Graph one sig Graph { sig Node { sig Edge { fact prevnext { Tree refines module Graph pred isconnected { pred nocycles { pred loneparent { fact istree { FeatureAlloy Composer * Graph Tree module Graph one sig Graph { sig Node { sig Edge { fact prevnext { pred isconnected { pred nocycles { pred loneparent { fact istree { * Plug-in of FeatureHouse Slide - 32
33 Feature Composition Graph module Graph one sig Graph { sig Node { sig Edge { fact prevnext { Tree refines module Graph pred isconnected { pred nocycles { pred loneparent { fact istree { FeatureAlloy Composer Graph Tree module Graph one sig Graph { sig Node { sig Edge { fact prevnext { pred isconnected { pred nocycles { pred loneparent { fact istree { Alloy Analyzer Slide - 33
34 Semantic Dependences Graph Example Graph module Graph one sig Graph { sig Node { sig Edge { fact prevnext { Tree refines module Graph pred isconnected { pred nocycles { pred loneparent { fact istree { BinaryTree refines module Graph fact binarytree { all n: Node #n.outedges =< 2 assert istree { all e, e : Edge e!= e => e.(src + dest)!= e.(src + dest) some n: Node (Graph.nodes = n) (Graph.nodes = n.^(edges.(src + dest))) all n: Node n not in (n.^(outedges.dest) + n.^(inedges.src)) all n: Node lone n.inedges check istree for 5 Semantic Dependence Slide - 34
35 Semantic Dependences Graph Example Graph module Graph one sig Graph { sig Node { sig Edge { fact prevnext { Tree refines module Graph pred isconnected { pred nocycles { pred loneparent { fact istree { BinaryTree refines module Graph fact binarytree { all n: Node #n.outedges =< 2 assert istree { all e, e : Edge e!= e => e.(src + dest)!= e.(src + dest) some n: Node (Graph.nodes = n) (Graph.nodes = n.^(edges.(src + dest))) all n: Node n not in (n.^(outedges.dest) + n.^(inedges.src)) all n: Node lone n.inedges check istree for 5 Semantic Dependence Slide - 35
36 Semantic Dependences Graph Example Graph module Graph one sig Graph { sig Node { sig Edge { fact prevnext { Tree refines module Graph pred isconnected { pred nocycles { pred loneparent { fact istree { BinaryTree refines module Graph fact binarytree { assert istree { check istree for 5 SearchTree refines module Graph sig LeftEdge, RightEdge extends Edge { fact searchtree { assert isbinarytree { check isbinarytree for 5 BinarySearch refines module Graph fact definesearchrel { fun search [n: Node, i: Int] : one Node { assert issearchtree { check issearchtree for 5 Slide - 36
37 Semantic Dependences Graph Example Graph module Graph one sig Graph { sig Node { sig Edge { fact prevnext { Tree refines module Graph pred isconnected { pred nocycles { pred loneparent { fact istree { BinaryTree refines module Graph fact binarytree { assert istree { check istree for 5 SearchTree refines module Graph sig LeftEdge, RightEdge extends Edge { fact searchtree { assert isbinarytree { check isbinarytree for 5 BinarySearch refines module Graph fact definesearchrel { fun search [n: Node, i: Int] : one Node { assert issearchtree { check issearchtree for 5 Slide - 37
38 Detect Unresolved Dependences Graph module Graph one sig Graph { sig Node { sig Edge { fact prevnext { BinarySearch refines module Graph fact definesearchrel { fun search [n: Node, i: Int] : one Node { assert issearchtree { check issearchtree for 5 Slide - 38
39 Detect Unresolved Dependences Graph module Graph one sig Graph { sig Node { sig Edge { fact prevnext { BinarySearch refines module Graph fact definesearchrel { fun search [n: Node, i: Int] : one Node { assert issearchtree { check issearchtree for 5 FeatureAlloy Composer Graph BinarySearch module Graph one sig Graph { sig Node { sig Edge { fact prevnext { fact definesearchrel { fun search [n: Node, i: Int] : one Node { assert issearchtree { check issearchtree for 5 Slide - 39
40 Detect Unresolved Dependences Graph module Graph one sig Graph { sig Node { sig Edge { fact prevnext { BinarySearch refines module Graph fact definesearchrel { fun search [n: Node, i: Int] : one Node { assert issearchtree { check issearchtree for 5 FeatureAlloy Composer Graph BinarySearch module Graph one sig Graph { sig Node { sig Edge { fact prevnext { fact definesearchrel { fun search [n: Node, i: Int] : one Node { assert issearchtree { check issearchtree for 5 Alloy Analyzer??? Slide - 40
41 Detect Unresolved Dependences Graph module Graph one sig Graph { sig Node { sig Edge { fact prevnext { BinarySearch refines module Graph fact definesearchrel { fun search [n: Node, i: Int] : one Node { assert issearchtree { check issearchtree for 5 FeatureAlloy Composer Graph BinarySearch module Graph one sig Graph { sig Node { sig Edge { fact prevnext { fact definesearchrel { fun search [n: Node, i: Int] : one Node { assert issearchtree { check issearchtree for 5 Alloy Analyzer Slide - 41
42 Feature Interactions Phone Example BasicPhone module Phone sig Phone {... abstract sig State { one sig Idle, Busy extends State {... pred incomingcall [in: Call, disj p, p : Phone] {... CallForwarding refines module Phone refines sig Phone { forward: lone Phone refines pred incomingcall [in: Call, disj p, p : Phone] {... assert isforwarded {... check isforwarded for 5 CallWaiting refines module Phone refines sig Phone { waitingcall: set Call... one sig Suspended extends State { refines pred incomingcall [in: Call, disj p, p : Phone] {... assert issuspended {... check issuspended for 5 Slide - 42
43 Feature Interactions Phone Example BasicPhone module Phone sig Phone {... abstract sig State { one sig Idle, Busy extends State {... pred incomingcall [in: Call, disj p, p : Phone] {... CallForwarding refines module Phone refines sig Phone { forward: lone Phone refines pred incomingcall [in: Call, disj p, p : Phone] {... assert isforwarded {... check isforwarded for 5 CallWaiting refines module Phone refines sig Phone { waitingcall: set Call... one sig Suspended extends State { refines pred incomingcall [in: Call, disj p, p : Phone] {... assert issuspended {... check issuspended for 5 Slide - 43
44 Feature Interactions Phone Example BasicPhone module Phone sig Phone {... abstract sig State { one sig Idle, Busy extends State {... pred incomingcall [in: Call, disj p, p : Phone] {... CallForwarding refines module Phone refines sig Phone { forward: lone Phone refines pred incomingcall [in: Call, disj p, p : Phone] {... assert isforwarded {... check isforwarded for 5 FeatureAlloy Composer Alloy Analyzer Slide - 44
45 Feature Interactions Phone Example BasicPhone module Phone sig Phone {... abstract sig State { one sig Idle, Busy extends State {... pred incomingcall [in: Call, disj p, p : Phone] {... FeatureAlloy Composer Alloy Analyzer CallWaiting refines module Phone refines sig Phone { waitingcall: set Call... one sig Suspended extends State { refines pred incomingcall [in: Call, disj p, p : Phone] {... assert issuspended {... check issuspended for 5 Slide - 45
46 Feature Interactions Phone Example BasicPhone module Phone sig Phone {... abstract sig State { one sig Idle, Busy extends State {... pred incomingcall [in: Call, disj p, p : Phone] {... CallForwarding refines module Phone refines sig Phone { forward: lone Phone refines pred incomingcall [in: Call, disj p, p : Phone] {... assert isforwarded {... check isforwarded for 5 FeatureAlloy Composer Alloy Analyzer CallWaiting refines module Phone refines sig Phone { waitingcall: set Call... one sig Suspended extends State { refines pred incomingcall [in: Call, disj p, p : Phone] {... assert issuspended {... check issuspended for 5 Slide - 46
47 Tool Chain and Case Studies Composition with [Apel et al., ICSE'09] Analysis with Alloy Analyzer Case study # Features # Semantic dependences # Feature interactions Graph product line Phone system Content addressable network POSIX file system Slide - 47
48 Feature-Oriented Verification Question: If we have a correct model, how do we know that the actual implementation is correct? Slide - 48
49 Feature-Oriented Verification Question: If we have a correct model, how do we know that the actual implementation is correct? Answer: Feature-oriented verification at implementation level Domain Domain Design Analysis & Specification Implementation Product Derivation Slide - 49
50 Feature-Oriented Verification Example* EncryptMessage Basic System SignMessage DecryptMessage ForwardMessage Addressbook VerifyMessage AutoResponder FilterMessage MailHost R Message * [Hall, J. ASE 2005] Slide - 50
51 Feature-Oriented Verification Example Encrypt void encrypt (struct client *client, struct *msg) { int i; for (i = 0; i < (*client).keyssize; i++) { if (strncmp (((*client).keys + i * MAX), (*msg).to, strlen ((*msg).to)) == 0) { printf ("> encrypted\n"); char newbody[max] = "[encrypted]\n"; strcat (newbody, (*msg).body); strcpy ((*msg).body, newbody); break; void outgoing (struct client *client, struct *msg) { encrypt (client, msg); original (client, msg); void setkeys (struct client *client, char *keys, int size) { (*client).keys = keys; (*client).keyssize = size; process call(mail(msg)) &&!isencrypted(msg) && currentid == msg.id error init call(incoming(msg)) && isencrypted(msg) currentid = msg.id Slide - 51
52 Feature-Oriented Verification Example Encrypt process void encrypt (struct client *client, struct *msg) { int i; for (i = 0; i < (*client).keyssize; i++) { if (strncmp (((*client).keys + i * MAX), (*msg).to, strlen ((*msg).to)) == 0) { printf ("> encrypted\n"); char newbody[max] = "[encrypted]\n"; strcat (newbody, (*msg).body); strcpy ((*msg).body, newbody); break; void outgoing (struct client *client, struct *msg) { encrypt (client, msg); original (client, msg); void setkeys (struct client *client, char *keys, int size) { (*client).keys = keys; (*client).keyssize = size; call(incoming(msg)) && isencrypted(msg) currentid = msg.id call(mail(msg)) &&!isencrypted(msg) && currentid == msg.id error init Slide - 52
53 Feature-Oriented Verification Overview Encrypt void encrypt (struct client *client, struct *msg) { int i; for (i = 0; i < (*client).keyssize; i++) { if (strncmp (((*client).keys + i * MAX), (*msg).to, strlen ((*msg).to)) == 0) { printf ("> encrypted\n"); char newbody[max] = "[encrypted]\n"; strcat (newbody, (*msg).body); strcpy ((*msg).body, newbody); break; void outgoing (struct client *client, struct *msg) { encrypt (client, msg); original (client, msg); void setkeys (struct client *client, char *keys, int size) { (*client).keys = keys; (*client).keyssize = size; process init error Forward FeatureC Composer CPA Model Checker void encrypt (struct client *client, struct *msg) { int i; for (i = 0; i < (*client).keyssize; i++) { if (strncmp (((*client).keys + i * MAX), (*msg).to, strlen ((*msg).to)) == 0) { printf ("> encrypted\n"); char newbody[max] = "[encrypted]\n"; strcat (newbody, (*msg).body); strcpy ((*msg).body, newbody); break; void outgoing (struct client *client, struct *msg) { encrypt (client, msg); original (client, msg); void setkeys (struct client *client, char *keys, int size) { (*client).keys = keys; (*client).keyssize = size; init error Slide - 53
54 Feature-Oriented Verification Overview Encrypt void encrypt (struct client *client, struct *msg) { int i; for (i = 0; i < (*client).keyssize; i++) { if (strncmp (((*client).keys + i * MAX), (*msg).to, strlen ((*msg).to)) == 0) { printf ("> encrypted\n"); char newbody[max] = "[encrypted]\n"; strcat (newbody, (*msg).body); strcpy ((*msg).body, newbody); break; void outgoing (struct client *client, struct *msg) { encrypt (client, msg); original (client, msg); void setkeys (struct client *client, char *keys, int size) { (*client).keys = keys; (*client).keyssize = size; Step 1: Composition process init error Forward FeatureC Composer CPA Model Checker void encrypt (struct client *client, struct *msg) { int i; for (i = 0; i < (*client).keyssize; i++) { if (strncmp (((*client).keys + i * MAX), (*msg).to, strlen ((*msg).to)) == 0) { printf ("> encrypted\n"); char newbody[max] = "[encrypted]\n"; strcat (newbody, (*msg).body); strcpy ((*msg).body, newbody); break; void outgoing (struct client *client, struct *msg) { encrypt (client, msg); original (client, msg); void setkeys (struct client *client, char *keys, int size) { (*client).keys = keys; (*client).keyssize = size; init error Slide - 54
55 Feature-Oriented Verification Overview Encrypt void encrypt (struct client *client, struct *msg) { int i; for (i = 0; i < (*client).keyssize; i++) { if (strncmp (((*client).keys + i * MAX), (*msg).to, strlen ((*msg).to)) == 0) { printf ("> encrypted\n"); char newbody[max] = "[encrypted]\n"; strcat (newbody, (*msg).body); strcpy ((*msg).body, newbody); break; void outgoing (struct client *client, struct *msg) { encrypt (client, msg); original (client, msg); void setkeys (struct client *client, char *keys, int size) { (*client).keys = keys; (*client).keyssize = size; Step 2: Model Checking process init error Forward FeatureC Composer CPA Model Checker void encrypt (struct client *client, struct *msg) { int i; for (i = 0; i < (*client).keyssize; i++) { if (strncmp (((*client).keys + i * MAX), (*msg).to, strlen ((*msg).to)) == 0) { printf ("> encrypted\n"); char newbody[max] = "[encrypted]\n"; strcat (newbody, (*msg).body); strcpy ((*msg).body, newbody); break; void outgoing (struct client *client, struct *msg) { encrypt (client, msg); original (client, msg); void setkeys (struct client *client, char *keys, int size) { (*client).keys = keys; (*client).keyssize = size; init error Slide - 55
56 Tool Chain and Case Study Tool chain Composition with [Apel et al., ICSE'09] Specification of observer automata (currently hand-coded) Model checking with CPA Checker (successor of BLAST [Beyer et al., STTT 2007]) Case study: System [Hall, J. ASE 2005] 10 features (7 implemented) 26 interactions (10 can be detected modularly) Slide - 56
57 Conclusion Feature-oriented software development Safe generation of software products Product line type system Feature-oriented specification and design Feature-oriented verification Slide - 57
58 FOSD Events 2nd Workshop on Feature-Oriented Software Development, in conjunction with GPCE and SLE 2010 Dagstuhl Seminar: Feature-Oriented Software Development (No ). January 9th - 14th, Slide - 58
59 Questions? Contact information Sven Apel, University of Passau, Germany FeatureHouse Related publications Sven Apel and Christian Kästner. An Overview of Feature-Oriented Software Development. Journal of Object Technology (JOT), 8(5):49 84, July Sven Apel, Christian Kästner, and Christian Lengauer. FeatureHouse: Language- Independent, Automated Software Composition. In Proc. ACM/IEEE International Conference on Software Engineering (ICSE), pages IEEE, May Sven Apel, Christian Kästner, Armin Größlinger, and Christian Lengauer. Type Safety for Feature-Oriented Product Lines. Automated Software Engineering An International Journal Slide - 59
60 Detected Interactions in the Example AddressBook vs. EncryptMessage SignMessage vs. VerifySignature SignMessage vs. ForwardMessage EncryptMessage vs. DecryptMessage EncryptMessage vs. VerifySignature EncryptMessage vs. AutoResponder EncryptMessage vs. AutoResponder EncryptMessage vs. ForwardMessage DecryptMessage vs. AutoResponder VerifySignature vs. ForwardMessage Slide - 60
A Case Study on Feature-Aware Verification
Universität Passau Fakultät für Informatik und Mathematik Master Thesis A Case Study on Feature-Aware Verification Stefan Boxleitner October 11, 2011 Advised by Dr.-Ing. Sven Apel Boxleitner, Stefan: A
Type-Safe Feature-Oriented Product Lines
Type-Safe Feature-Oriented Product Lines Sven Apel, Christian Kästner, Armin Größlinger, and Christian Lengauer Department of Informatics and Mathematics, University of Passau {apel,groesslinger,lengauer}@uni-passau.de
Colligens: A Tool to Support the Development of Preprocessor-based Software Product Lines in C
Colligens: A Tool to Support the Development of Preprocessor-based Software Product Lines in C Flávio Medeiros 1, Thiago Lima 2, Francisco Dalton 2, Márcio Ribeiro 2, Rohit Gheyi 1, Baldoino Fonseca 2
A Case Study in Using ACL2 for Feature-Oriented Verification
A Case Study in Using ACL2 for Feature-Oriented Verification Kathi Fisler and Brian Roberts WPI Computer Science Configurations of Features verify signature mailhost addressbook filter remail decrypt signing
How To Combine Feature-Oriented And Aspect-Oriented Programming To Support Software Evolution
Combining Feature-Oriented and Aspect-Oriented Programming to Support Software Evolution Sven Apel, Thomas Leich, Marko Rosenmüller, and Gunter Saake Department of Computer Science Otto-von-Guericke-University
Model-based Test Case Generation for (Dynamic) Software Product Lines
Model-based Test Case Generation for (Dynamic) Software Product Lines The 6th Meeting on Feature-oriented Software Development 2014, May 04-07 Schloss Dagstuhl, Germany DFG Priority Programme 1593 Design
Feature-Oriented Software Development
Feature-Oriented Software Development A Short Tutorial on Feature-Oriented Programming, Virtual Separation of Concerns, and Variability-Aware Analysis Christian Kästner 1 and Sven Apel 2 1 Philipps University
An Overview of Feature-Oriented Software Development
Vol. 8, No. 5, July August 2009 An Overview of Feature-Oriented Software Development Sven Apel, Department of Informatics and Mathematics, University of Passau, Germany Christian Kästner, School of Computer
Combining Feature-Oriented and Aspect-Oriented Programming to Support Software Evolution
Combining Feature-Oriented and Aspect-Oriented Programming to Support Software Evolution Sven Apel, Thomas Leich, Marko Rosenmüller, and Gunter Saake Department of Computer Science University of Magdeburg,
Verification of Software Product Lines Using Contracts
Verification of Software Product Lines Using Contracts Thomas Thüm School of Computer Science University of Magdeburg Magdeburg, Germany Abstract Software product lines are widely used to achieve high
Using Eclipse CDT/PTP for Static Analysis
PTP User-Developer Workshop Sept 18-20, 2012 Using Eclipse CDT/PTP for Static Analysis Beth R. Tibbitts IBM STG tibbitts@us.ibm.com "This material is based upon work supported by the Defense Advanced Research
FeatureIDE: An Extensible Framework for Feature-Oriented Software Development
FeatureIDE: An Extensible Framework for Feature-Oriented Software Development Thomas Thüm a, Christian Kästner b, Fabian Benduhn a, Jens Meinicke a, Gunter Saake a, Thomas Leich c a University of Magdeburg,
Potential Synergies of Theorem Proving and Model Checking for Software Product Lines
Potential Synergies of Theorem Proving and Model Checking for Software Product Lines Thomas Thüm University of Magdeburg Martin Hentschel University of Darmstadt Jens Meinicke University of Magdeburg Alexander
Generating Aspect Code from UML Models
Generating Aspect Code from UML Models Iris Groher Siemens AG, CT SE 2 Otto-Hahn-Ring 6 81739 Munich, Germany Iris.Groher@fh-hagenberg.at Stefan Schulze Siemens AG, CT SE 2 Otto-Hahn-Ring 6 81739 Munich,
International Journal of Web & Semantic Technology (IJWesT) Vol.3, No.3, July 2012. Vishnuvardhan Mannava 1 and T. Ramesh 2
COMPOSITE DESIGN PATTERN FOR FEATURE- ORIENTED SERVICE INJECTION AND COMPOSITION OF WEB SERVICES FOR DISTRIBUTED COMPUTING SYSTEMS WITH SERVICE ORIENTED ARCHITECTURE Vishnuvardhan Mannava 1 and T. Ramesh
Generalized CHR machines
K.U.Leuven, Belgium Universität Ulm, Germany CHR 08 Workshop Hagenberg, Austria, July 2008 Complexity-wise completeness CHR machines 2/27 1 Introduction Complexity-wise completeness CHR machines 2 3 4
today 1,700 special programming languages used to communicate in over 700 application areas.
today 1,700 special programming languages used to communicate in over 700 application areas. Computer Software Issues, an American Mathematical Association Prospectus, July 1965, quoted in P. J. Landin
How to Write a Checker in 24 Hours
How to Write a Checker in 24 Hours Clang Static Analyzer Anna Zaks and Jordan Rose Apple Inc. What is this talk about? The Clang Static Analyzer is a bug finding tool It can be extended with custom checkers
SPLConfig: Product Configuration in Software Product Line
SPLConfig: Product Configuration in Software Product Line Lucas Machado, Juliana Pereira, Lucas Garcia, Eduardo Figueiredo Department of Computer Science, Federal University of Minas Gerais (UFMG), Brazil
VisCG: Creating an Eclipse Call Graph Visualization Plug-in. Kenta Hasui, Undergraduate Student at Vassar College Class of 2015
VisCG: Creating an Eclipse Call Graph Visualization Plug-in Kenta Hasui, Undergraduate Student at Vassar College Class of 2015 Abstract Call graphs are a useful tool for understanding software; however,
Automated Validation & Verification of Software Paper Presentation
Regression Test Selection for Java Software Salvador Valencia Rodríguez Automated Validation & Verification of Software Paper Presentation Paper authors Mary Jean Harrold James A. Jones Tongyu Li Donglin
RobbyDBMS A Case Study on Hardware/Software Product Line Engineering
RobbyDBMS A Case Study on Hardware/Software Product Line Engineering Jörg Liebig and Sven Apel and Christian Lengauer Department of Infmatics and Mathematics University of Passau, Germany {joliebig,apel,lengauer}@fim.uni-passau.de
Bridging the Gap between Variability in Client Application and Database Schema
Bridging the Gap between Variability in Client Application and Database Schema Norbert Siegmund 1, Christian Kästner 1, Marko Rosenmüller 1, Florian Heidenreich 2, Sven Apel 3, and Gunter Saake 1 1 School
Introduction to Data-flow analysis
Introduction to Data-flow analysis Last Time LULESH intro Typed, 3-address code Basic blocks and control flow graphs LLVM Pass architecture Data dependencies, DU chains, and SSA Today CFG and SSA example
The CompCert verified C compiler
The CompCert verified C compiler Compiler built and proved by Xavier Leroy et al. Talk given by David Pichardie - Harvard University / INRIA Rennes Slides largely inspired by Xavier Leroy own material
Analysing Structural Dependencies in Software Product Lines
Analysing Structural Dependencies in Software Product Lines Using Distribution and Network Statistics by Sven Apel, Sergiy Kolnesikov, Stefan Sobernig; in cooperation with Jörg Liebig and Norbert Siegmund
GSM. Global System for Mobile Communications, 1992. Security in mobile phones. System used all over the world. Sikkerhed04, Aften Trusler
GSM Global System for Mobile Communications, 1992 Security in mobile phones System used all over the world 1 GSM: Threat Model What Cloning Eavesdropping Tracking Who Criminals Secret Services Why Break
Integration of Application Business Logic and Business Rules with DSL and AOP
Integration of Application Business Logic and Business Rules with DSL and AOP Bogumiła Hnatkowska and Krzysztof Kasprzyk Wroclaw University of Technology, Wyb. Wyspianskiego 27 50-370 Wroclaw, Poland Bogumila.Hnatkowska@pwr.wroc.pl
Using Library Dependencies for Clustering
Using Library Dependencies for Clustering Jochen Quante Software Engineering Group, FB03 Informatik, Universität Bremen quante@informatik.uni-bremen.de Abstract: Software clustering is an established approach
CHAPTER 20 TESING WEB APPLICATIONS. Overview
CHAPTER 20 TESING WEB APPLICATIONS Overview The chapter describes the Web testing. Web testing is a collection of activities whose purpose is to uncover errors in WebApp content, function, usability, navigability,
Optimizing Generation of Object Graphs in Java PathFinder
Optimizing Generation of Object Graphs in Java PathFinder Milos Gligoric, Tihomir Gvero, Steven Lauterburg, Darko Marinov, Sarfraz Khurshid JPF Workshop 1.5.8 Bugs Six Decades Ago 1947: Harvard Mark II
mbeddr: an Extensible C-based Programming Language and IDE for Embedded Systems
mbeddr: an Extensible C-based Programming Language and IDE for Embedded Systems Markus Voelter independent/itemis voelter@acm.org Daniel Ratiu Bernhard Schaetz Fortiss {ratiu schaetz@fortiss.org Bernd
Firewall Design: Consistency, Completeness, Compactness
Firewall Design: Consistency, Completeness, Compactness Alex X. Liu alex@cs.utexas.edu Department of Computer Sciences The University of Texas at Austin Austin, Texas 78712-1188, U.S.A. March, 2004 Co-author:
An Algebra for Feature-Oriented Software Development
An Algebra for Feature-Oriented Software Development Sven Apel 1, Christian Lengauer 1, Don Batory 2, Bernhard Möller 3, and Christian Kästner 4 1 Department of Informatics and Mathematics, University
Visualizing Information Flow through C Programs
Visualizing Information Flow through C Programs Joe Hurd, Aaron Tomb and David Burke Galois, Inc. {joe,atomb,davidb}@galois.com Systems Software Verification Workshop 7 October 2010 Joe Hurd, Aaron Tomb
International Workshop on Field Programmable Logic and Applications, FPL '99
International Workshop on Field Programmable Logic and Applications, FPL '99 DRIVE: An Interpretive Simulation and Visualization Environment for Dynamically Reconægurable Systems? Kiran Bondalapati and
The Timing Definition Language (TDL)
The Timing Definition Language (TDL) Prof. Dr. Wolfgang Pree Dr. (ETH) Josef Templ Department of Computer Science Universität Salzburg cs.uni-salzburg.at MoDECS.cc PREEtec.com Overview TDL programming
Development of a Feature Modeling Tool using Microsoft DSL Tools.
Development of a Feature Modeling Tool using Microsoft DSL Tools. GIRO Technical Report 2009-1.ver 1.0 (05/01/2009) Rubén Fernández, Miguel A. Laguna, Jesús Requejo, Nuria Serrano. Department of Computer
SCADE System 17.0. Technical Data Sheet. System Requirements Analysis. Technical Data Sheet SCADE System 17.0 1
SCADE System 17.0 SCADE System is the product line of the ANSYS Embedded software family of products and solutions that empowers users with a systems design environment for use on systems with high dependability
Last Class: OS and Computer Architecture. Last Class: OS and Computer Architecture
Last Class: OS and Computer Architecture System bus Network card CPU, memory, I/O devices, network card, system bus Lecture 3, page 1 Last Class: OS and Computer Architecture OS Service Protection Interrupts
FAME-DBMS: Tailor-made Data Management Solutions for Embedded Systems
FAME-DBMS: Tailor-made Data Management Solutions for Embedded Systems Marko Rosenmüller 1, Norbert Siegmund 1, Horst Schirmeier 2, Julio Sincero 3, Sven Apel 4, Thomas Leich 5, Olaf Spinczyk 2, Gunter
Programming Without a Call Stack: Event-driven Architectures
Gregor Hohpe Google Programming Without a Call Stack: -driven Architectures www.eaipatterns.com Who's Gregor? Distributed systems, enterprise integration, service-oriented architectures MQ, MSMQ, JMS,
Unification of AOP and FOP in Model Driven Development
Chapter 5 Unification of AOP and FOP in Model Driven Development I n this chapter, AOP and FOP have been explored to analyze the similar and different characteristics. The main objective is to justify
STIC-AMSUD project meeting, Recife, Brazil, July 2008. Quality Management. Current work and perspectives at InCo
InCo Universidad de la República STIC-AMSUD project meeting, Recife, Brazil, July 2008 Quality Management Current work and perspectives at InCo Lorena Etcheverry, Laura González, Adriana Marotta, Verónika
INF5140: Specification and Verification of Parallel Systems
INF5140: Specification and Verification of Parallel Systems Lecture 7 LTL into Automata and Introduction to Promela Gerardo Schneider Department of Informatics University of Oslo INF5140, Spring 2007 Gerardo
Generating Test Cases With High Branch Coverage for Web Applications
Generating Test Cases With High Branch Coverage for Web Applications Andrey Zakonov and Anatoly Shalyto National Research University of Information Technologies, Mechanics and Optics, Saint-Petersburg,
Metrics for Analyzing the Quality of Model Transformations
Metrics for Analyzing the Quality of Model Transformations Marcel van Amstel 1 Christian Lange 2 Mark van den Brand 1 1 Eindhoven University of Technology, The Netherlands 2 Federal Office for Information
A Security Domain Model for Static Analysis and Verification of Software Programs
A Security Domain Model for Static Analysis and Verification of Software Programs Alan B. Shaffer Naval Postgraduate School Computer Science Dept Monterey, CA, USA abshaffe@nps.edu Abstract- Unauthorized
Model Checking Distributed Software
Model Checking Distributed Software Sagar Chaki September 19, 2014 Software Engineering Institute Carnegie Mellon University Pittsburgh, PA 15213 Model Checking and Me 1997 : Ed visits IIT Kharagpur Just
A Classification of Model Checking-based Verification Approaches for Software Models
A Classification of Model Checking-based Verification Approaches for Software Models Petra Brosch, Sebastian Gabmeyer, Martina Seidl Sebastian Gabmeyer Business Informatics Group Institute of Software
Dsc+Mock: A Test Case + Mock Class Generator in Support of Coding Against Interfaces
Dsc+Mock: A Test Case + Mock Class Generator in Support of Coding Against Interfaces Mainul Islam, Christoph Csallner Computer Science and Engineering Department University of Texas at Arlington Arlington,
To Java SE 8, and Beyond (Plan B)
11-12-13 To Java SE 8, and Beyond (Plan B) Francisco Morero Peyrona EMEA Java Community Leader 8 9...2012 2020? Priorities for the Java Platforms Grow Developer Base Grow Adoption
Tailored Source Code Transformations to Synthesize Computationally Diverse Program Variants. Benoit Baudry, Simon Allier, Martin Monperrus
Tailored Source Code Transformations to Synthesize Computationally Diverse Program Variants Benoit Baudry, Simon Allier, Martin Monperrus This talk is about the generation of very large quantities of sosie
Embedded Software Development with MPS
Embedded Software Development with MPS Markus Voelter independent/itemis The Limitations of C and Modeling Tools Embedded software is usually implemented in C. The language is relatively close to the hardware,
Semantic Analysis: Types and Type Checking
Semantic Analysis Semantic Analysis: Types and Type Checking CS 471 October 10, 2007 Source code Lexical Analysis tokens Syntactic Analysis AST Semantic Analysis AST Intermediate Code Gen lexical errors
Dungeon: A Case Study of Feature-Oriented Programming with Virtual Classes
Dungeon: A Case Study of Feature-Oriented Programming with Virtual Classes Vaidas Gasiunas Ivica Aracic Technische Universität Darmstadt, Germany {gasiunas,aracic}@informatik.tu-darmstadt.de Abstract A
Graph-Based Linking and Visualization for Legislation Documents (GLVD) Dincer Gultemen & Tom van Engers
Graph-Based Linking and Visualization for Legislation Documents (GLVD) Dincer Gultemen & Tom van Engers Demand of Parliaments Semi-structured information and semantic technologies Inter-institutional business
Industrial Adoption of Automatically Extracted GUI Models for Testing
Industrial Adoption of Automatically Extracted GUI Models for Testing Pekka Aho 1,2 pekka.aho@vtt.fi, Matias Suarez 3 matias.suarez@f-secure.com, Teemu Kanstrén 1,4 teemu.kanstren@vtt.fi, and Atif M. Memon
Software security. Buffer overflow attacks SQL injections. Lecture 11 EIT060 Computer Security
Software security Buffer overflow attacks SQL injections Lecture 11 EIT060 Computer Security Buffer overflow attacks Buffer overrun is another common term Definition A condition at an interface under which
CS 6371: Advanced Programming Languages
CS 6371: Advanced Programming Languages Dr. Kevin Hamlen Spring 2014 Fill out, sign, and return prereq forms: Course number: CS 6371 Section: 1 Prerequisites: CS 5343: Algorithm Analysis & Data Structures
Chapter 13 Configuration Management
Object-Oriented Software Engineering Using UML, Patterns, and Java Chapter 13 Configuration Management Outline of the Lecture Purpose of Software Configuration Management (SCM)! Motivation: Why software
VeriTech - A Framework for Translating among Model Description Notations
Software Tools for Technology Transfer manuscript No. (will be inserted by the editor) VeriTech - A Framework for Translating among Model Description Notations Orna Grumberg and Shmuel Katz Computer Science
Otto von Guericke University Magdeburg. Faculty of Computer Science Department of Technical and Business Information Systems.
Otto von Guericke University Magdeburg Faculty of Computer Science Department of Technical and Business Information Systems Thesis Empirical Comparison of FOSD Approaches Regarding Program Comprehension
Verifying Semantic of System Composition for an Aspect-Oriented Approach
2012 International Conference on System Engineering and Modeling (ICSEM 2012) IPCSIT vol. 34 (2012) (2012) IACSIT Press, Singapore Verifying Semantic of System Composition for an Aspect-Oriented Approach
A Manifesto for Semantic Model Differencing
A Manifesto for Semantic Model Differencing ME-10, October 2010 Shahar Maoz, Jan Oliver Ringert, Bernhard Rumpe Lehrstuhl Informatik 3 () http://www.se-rwth.de/ Seite 2 One slide abstract Existing approaches
Tool Support for Inspecting the Code Quality of HPC Applications
Tool Support for Inspecting the Code Quality of HPC Applications Thomas Panas Dan Quinlan Richard Vuduc Center for Applied Scientific Computing Lawrence Livermore National Laboratory P.O. Box 808, L-550
Lecture 2 Introduction to Data Flow Analysis
Lecture 2 Introduction to Data Flow Analysis I. Introduction II. Example: Reaching definition analysis III. Example: Liveness analysis IV. A General Framework (Theory in next lecture) Reading: Chapter
Processing and data collection of program structures in open source repositories
1 Processing and data collection of program structures in open source repositories JEAN PETRIĆ, TIHANA GALINAC GRBAC AND MARIO DUBRAVAC, University of Rijeka Software structure analysis with help of network
Language-Independent Safe Decomposition of Legacy Applications into Features
Nr.: FIN-02-2008 Language-Independent Safe Decomposition of Legacy Applications into Features Christian Kästner, Sven Apel, Salvador Trujillo, Martin Kuhlemann, Don Batory Arbeitsgruppe Datenbanken Fakultät
Principles of Software Construction: Objects, Design, and Concurrency. Course Introduction. toad. toad 15-214. Fall 2012. School of Computer Science
Principles of Software Construction: Objects, Design, and Concurrency Course Introduction Fall 2012 Charlie Garrod Christian Kästner School of Computer Science and J Aldrich 2012 W Scherlis 1 Construction
HECTOR a software model checker with cooperating analysis plugins. Nathaniel Charlton and Michael Huth Imperial College London
HECTOR a software model checker with cooperating analysis plugins Nathaniel Charlton and Michael Huth Imperial College London Introduction HECTOR targets imperative heap-manipulating programs uses abstraction
Origin Tracking in Attribute Grammars
Origin Tracking in Attribute Grammars Kevin Williams and Eric Van Wyk University of Minnesota Stellenbosch, WG2.11, January 20-22, 2015 1 / 37 First, some advertising Multiple new faculty positions at
A TOOL FOR DATA STRUCTURE VISUALIZATION AND USER-DEFINED ALGORITHM ANIMATION
A TOOL FOR DATA STRUCTURE VISUALIZATION AND USER-DEFINED ALGORITHM ANIMATION Tao Chen 1, Tarek Sobh 2 Abstract -- In this paper, a software application that features the visualization of commonly used
Coordinated Visualization of Aspect-Oriented Programs
Coordinated Visualization of Aspect-Oriented Programs Álvaro F. d Arce 1, Rogério E. Garcia 1, Ronaldo C. M. Correia 1 1 Faculdade de Ciências e Tecnologia Universidade Estadual Paulista Júlio de Mesquita
Chapter 13 Configuration Management
Chapter 13 Configuration Management Using UML, Patterns, and Java Object-Oriented Software Engineering Outline of the Lecture Purpose of Software Configuration Management (SCM)! Motivation: Why software
How To Detect A Buffer Overflow Vulnerability In Binary Code
Buffer Overflow Vulnerability Detection in the Binary Code Shehab Gamal El-Dien, Reda Salama, Ahmed Eshak shehab@ispofegypt.com, redasalama@hotmail.com, a_issac@sakhr.com Al-Azhar University, Faculty of
B) Using Processor-Cache Affinity Information in Shared Memory Multiprocessor Scheduling
A) Recovery Management in Quicksilver 1) What role does the Transaction manager play in the recovery management? It manages commit coordination by communicating with servers at its own node and with transaction
Development of Tool Extensions with MOFLON
Development of Tool Extensions with MOFLON Ingo Weisemöller, Felix Klar, and Andy Schürr Fachgebiet Echtzeitsysteme Technische Universität Darmstadt D-64283 Darmstadt, Germany {weisemoeller klar schuerr}@es.tu-darmstadt.de
Graph Analytics in Big Data. John Feo Pacific Northwest National Laboratory
Graph Analytics in Big Data John Feo Pacific Northwest National Laboratory 1 A changing World The breadth of problems requiring graph analytics is growing rapidly Large Network Systems Social Networks
Fun with Phantom Types
1 Fun with Phantom Types RALF HINZE Institut für Informatik III, Universität Bonn Römerstraße 164, 53117 Bonn, Germany Email: ralf@informatik.uni-bonn.de Homepage: http://www.informatik.uni-bonn.de/~ralf
Research Overview in. Formal Method in Software Engineering Laboratory
Research Overview in Formal Method in Software Engineering Laboratory Head of Lab: Prof. Belawati H Widjaja, Ph.D Presented By: Dr. Ade Azurat Wednesday 21 January 2015 FMSE Workshop 2015 @ Fasilkom UI
MIT Kerberos Software Development Roadmap
MIT Kerberos Software Development Roadmap Tom Yu MIT Kerberos Consortium November 3, 2008 www.kerberos.org 2008 The MIT Kerberos Consortium. All Rights Reserved. Overview Timeline Completed krb5-1.7 goals
Demonstration of an Automated Integrated Test Environment for Web-based Applications
Demonstration of an Automated Integrated Test Environment for Web-based Applications Tiziana Margaria 1,2, Oliver Niese 2, and Bernhard Steffen 2 1 METAFrame Technologies GmbH, Dortmund, Germany TMargaria@METAFrame.de
Applications of formal verification for secure Cloud environments at CEA LIST
Applications of formal verification for secure Cloud environments at CEA LIST Nikolai Kosmatov joint work with A.Blanchard, F.Bobot, M.Lemerre,... SEC2, Lille, June 30 th, 2015 N. Kosmatov (CEA LIST) Formal
Towards practical reactive security audit using extended static checkers 1
Towards practical reactive security audit using extended static checkers 1 Julien Vanegue 1 Shuvendu K. Lahiri 2 1 Bloomberg LP, New York 2 Microsoft Research, Redmond May 20, 2013 1 The work was conducted
Testing Software Product Lines Using Incremental Test Generation
Testing Software Product Lines Using Incremental Test Generation Engin Uzuncaova Daniel Garcia Sarfraz Khurshid Don Batory Dept. of Electrical and Computer Engineering Dept. of Computer Sciences The University
Habanero Extreme Scale Software Research Project
Habanero Extreme Scale Software Research Project Comp215: Java Method Dispatch Zoran Budimlić (Rice University) Always remember that you are absolutely unique. Just like everyone else. - Margaret Mead
Introducing Formal Methods. Software Engineering and Formal Methods
Introducing Formal Methods Formal Methods for Software Specification and Analysis: An Overview 1 Software Engineering and Formal Methods Every Software engineering methodology is based on a recommended
Aspectual Mixin Layers
Aspectual Mixin Layers Sven Apel, Thomas Leich, and Gunter Saake Department of Computer Science University of Magdeburg, Germany email: {apel,leich,saake}@iti.cs.uni-magdeburg.de Abstract. Feature-Oriented
mbeddr: an Extensible MPS-based Programming Language and IDE for Embedded Systems
mbeddr: an Extensible MPS-based Programming Language and IDE for Embedded Systems Markus Voelter independent/itemis voelter@acm.org Daniel Ratiu Bernhard Schaetz Fortiss {ratiu schaetz}@fortiss.org Bernd
NP-complete? NP-hard? Some Foundations of Complexity. Prof. Sven Hartmann Clausthal University of Technology Department of Informatics
NP-complete? NP-hard? Some Foundations of Complexity Prof. Sven Hartmann Clausthal University of Technology Department of Informatics Tractability of Problems Some problems are undecidable: no computer
Rigorous Software Development CSCI-GA 3033-009
Rigorous Software Development CSCI-GA 3033-009 Instructor: Thomas Wies Spring 2013 Lecture 5 Disclaimer. These notes are derived from notes originally developed by Joseph Kiniry, Gary Leavens, Erik Poll,
Fabio Patrizi DIS Sapienza - University of Rome
Fabio Patrizi DIS Sapienza - University of Rome Overview Introduction to Services The Composition Problem Two frameworks for composition: Non data-aware services Data-aware services Conclusion & Research
Questions? Assignment. Techniques for Gathering Requirements. Gathering and Analysing Requirements
Questions? Assignment Why is proper project management important? What is goal of domain analysis? What is the difference between functional and non- functional requirements? Why is it important for requirements
WIRD AG Solution Proposal Project- & Portfolio-Management
WIRD AG Solution Proposal Project- & Portfolio-Management Overview In order to address the need to control resources, time and cost in projects and in order to develop applications for System z, Wird AG,
Variability in Service-Oriented Systems: An Analysis of Existing Approaches
Variability in -Oriented Systems: An Analysis of Existing Approaches Holger Eichelberger and Christian Kröher and Klaus Schmid 1 Software Systems Engineering, Institute of Computer Science, University
Graph-Grammar Based Completion and Transformation of SDL/UML-Diagrams
Graph-Grammar Based Completion and Transformation of SDL/UML-Diagrams Position Paper Ulrich A. Nickel, Robert Wagner University of Paderborn Warburger Straße 100 D-33098 Paderborn Germany [duke, wag25]@uni-paderborn.de
Revel8or: Model Driven Capacity Planning Tool Suite
Revel8or: Model Driven Capacity Planning Tool Suite Liming Zhu 1,2, Yan Liu 1,2, Ngoc Bao Bui 1,2,Ian Gorton 3 1 Empirical Software Engineering Program, National ICT Australia Ltd. 2 School of Computer
Writing a C-based Client/Server
Working the Socket Writing a C-based Client/Server Consider for a moment having the massive power of different computers all simultaneously trying to compute a problem for you -- and still being legal!
Integrated Model-based Software Development and Testing with CSD and MTest
Integrated Model-based Software Development and Testing with CSD and Andreas Rau / Mirko Conrad / Helmut Keller / Ines Fey / Christian Dziobek DaimlerChrysler AG, Germany fa-stz-andreas.rau Mirko.Conrad